Finding the K shortest hyperpaths using reoptimization

Authors:
Lars Relund Nielsen;Daniele Pretolani;Kim Allan Andersen
Affiliations:
Research Unit of Statistics and Decision Analysis, Danish Institute of Agricultural Sciences, Research Centre Foulum, P.O. Box 50, DK-8830 Tjele, Denmark;Department of Mathematics and Computer Science, Universití di Camerino, Via Madonna delle Carceri, I-62032 Camerino (MC), Italy;Department of Accounting, Finance and Logistics, Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Venue:
Operations Research Letters
Year:
2006

Citing 7
Cited 2

Data structures and network algorithms

Data structures and network algorithms
Hyperpaths and shortest hyperpaths

COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
Directed hypergraphs and applications

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Gainfree Leontief substitution flow problems

Mathematical Programming: Series A and B
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks

Transportation Science
Finding the K shortest hyperpaths

Computers and Operations Research

Finding Best k Policies

ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Ranking policies in discrete Markov decision processes

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.