Finding the K shortest hyperpaths

Computers and Operations Research

Volumn 32, Issue 6, 2005, Pages 1477-1497

  Nielsen, Lars Relund ^a   Andersen, Kim Allan ^b   Pretolani, Daniele ^c  

^a AARHUS UNIVERSITY   (Denmark)

^b AARHUS SCHOOL OF BUSINESS   (Denmark)

^c UNIVERSITY OF CAMERINO   (Italy)

Author keywords

Directed hypergraphs; K shortest hyperpaths; K shortest paths; Network programming

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DYNAMIC PROGRAMMING; GRAPH THEORY; PARAMETER ESTIMATION; REAL TIME SYSTEMS;

DIRECTED HYPERGRAPHS; K SHORTEST HYPERGRAPHS; K SHORTEST PATHS; MINIMUM EXPECTED TRAVEL TIME (MET); NETWORK PROGRAMMING;

PROBLEM SOLVING;

EID: 9544231685     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.11.014     Document Type: Article

References (21)

1. Hoffman W, Pavley R. A method for the solution of the N'th best path problem. Journal of the Association for Computing Machinery 1959;6:506-14.
2. Eppstein D. Finding the k shortest paths. SIAM Journal on Computing 1999;28(2):652-73.
3. Jiménez VM, Marzal A. Computing the k shortest paths: a new algorithm and an experimental comparison. Lecture Notes in Computer Science 1999;1668:15-29.
4. Yen YJ. Finding the k shortest loopless paths in a network. Management Science 1971;17(11):712-6.
5. Lawler EL. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path. Management Science 1972;18(7):401-5.
6. Coutinho-Rodrigues JM, Climaco JCN, Current JR. An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Computers and Operations Research 1999;26:789-98.
7. Handler GY, Zang I. A dual algorithm for the constrained shortest path problem. Networks 1980;10:293-310.
8. Gallo G, Longo G, Pallottino S, Nguyen S. Directed hypergraphs and applications. Discrete Applied Mathematics 1993;42:177-201.
9. Miller-Hooks ED. Adaptive- least-expected time paths in stochastic, time-varying transportation and data networks. Networks 2000;37(1):35-52.
10. Miller-Hooks ED, Mahmassani HS. Optimal routing of hazardous-materials in stochastic, time-varying transportation networks. Transportation Research Record 1998;1645:143-51.
11. Hall RW. The fastest path through a network with random time-dependent travel times. Transportation Science 1986;20(3):182-8.
12. Pretolani D. A directed hypergraph model for random time dependent shortest paths. European Journal of Operational Research 2000;123:315-24.
13. Cohen J. Multiobjective programming and planning. New York: Academic Press; 1978.
14. Nielsen LR, Andersen KA, Pretolani D. Bicriterion shortest hyperpaths in random time-dependent networks. IMA Journal of Management Mathematics, to appear.
15. Gallo G, Gentile C, Pretolani D, Rago G. Max Horn SAT and the minimum cut problem in directed hypergraphs. Mathematical Programming 1998;80:213-37.
16. Ausiello G, Italiano GF, Nanni U. Optimal traversal of directed hypergraphs. Technical report TR-92-073, International Computer Science Institute, Berkeley, CA, September 1992.
17. Gallo G, Scutellà MG. Minimum makespan assembly plans. Technical report 10, Dipartimento di Informatica. Università di Pisa, September 1998.
18. Nguyen S, Pallottino S. Equilibrium traffic assignment for large scale transit networks. European Journal of Operational Research 1988;37:176-86.
19. Thulasiraman K, Swamy MNS. Graphs: theory and algorithms. New York: Wiley-Interscience; 1992.
20. Gallo G, Pallottino S. Hypergraph models and algorithms for the assembly problem. Technical report 6, Dipartimento di Informatica, Università di Pisa, March 1992.
21. Martins EQV, Pascoal MMB. A new implementation of Yen's ranking loopless paths algorithm. Technical report, Centro de Informatica e Sistemas, 2000. Available at http://www.mat.uc.pt/~eqvni/.