| Article ID: | iaor20062258 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 2 |
| Start Page Number: | 155 |
| End Page Number: | 164 |
| Publication Date: | Mar 2006 |
| Journal: | Operations Research Letters |
| Authors: | Pretolani Daniele, Andersen Kim Allan, Nielsen Lars Relund |
| Keywords: | networks: path |
We present some reoptimization techniques for computing (shortest) hyperpath weights in a directed hypergraph. These techniques are exploited to improve the worst-case computational complexity (as well as the practical performance) of an algorithm finding the