|
|||||
|
|
Finding the K shortest hyperpaths using reoptimization |
|
| Authors: | Lars Relund Nielsen Daniele Pretolani |
| Affiliation: | a Research Unit of Statistics and Decision Analysis, Danish Institute of Agricultural Sciences, Research Centre Foulum, P.O. Box 50, DK-8830 Tjele, Denmark b Department of Mathematics and Computer Science, Università di Camerino, Via Madonna delle Carceri, I-62032 Camerino (MC), Italy c Department of Accounting, Finance and Logistics, Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark |
| 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. |
| Keywords: | Network programming Directed hypergraphs K shortest hyperpaths Reoptimization |
| 本文献已被 ScienceDirect 等数据库收录！ | |