| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143412 | Operations Research Letters | 2006 | 10 Pages |
Abstract
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 K shortest hyperpaths in acyclic hypergraphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen,