Finding the K shortest hyperpaths using reoptimization

Operations Research Letters

Volumn 34, Issue 2, 2006, Pages 155-164

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

^a DANISH INSTITUTE OF AGRICULTURAL SCIENCES   (Denmark)

^b UNIVERSITY OF CAMERINO   (Italy)

^c AARHUS SCHOOL OF BUSINESS   (Denmark)

Author keywords

Directed hypergraphs; K shortest hyperpaths; Network programming; Reoptimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION;

HYPERGRAPHS; REOPTIMIZATION;

OPERATIONS RESEARCH;

EID: 29144477381     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.04.008     Document Type: Article

References (14)

1. G. Ausiello, P.G. Franciosa, and D. Frigioni Directed hypergraphs: problems, algorithmic results, and a novel decremental approach Lecture Notes in Comput. Sci. 2202 2001 312 328
2. G. Ausiello, G.F. Italiano, U. Nanni, Optimal traversal of directed hypergraphs, Technical Report TR-92-073, International Computer Science Institute, Berkeley, CA, September 1992.
3. G. Gallo, G. Longo, S. Pallottino, and S. Nguyen Directed hypergraphs and applications Discrete Appl. Math. 42 1993 177 201
4. G. Gallo, and M.G. Scutellà A note on minimum makespan assembly plans Euro. J. Oper. Res. 142 2 2002 309 320
5. R.G. Jeroslow, K. Martin, R.L. Rardin, and J. Wang Gainfree Leontief substitution flow problems Mathem. Program. 57 1992 375 414
6. E.D. Miller-Hooks, and H.S. Mahmassani Optimal routing of hazardous materials in stochastic, time-varying transportation networks Transportation Res. Record 1645 1998 143 151
7. E.D. Miller-Hooks, and H.S. Mahmassani Least expected time paths in stochastic, time-varying transportation networks Transportation Sci. 34 2 2000 198 215
8. S. Nguyen, and S. Pallottino Equilibrium traffic assignment for large-scale transit networks Euro. J. Oper. Res. 37 2 1988 176 186
9. S. Nguyen, S. Pallottino, Hyperpaths and shortest hyperpaths, in: Combinatorial optimization (Como, 1986), Lecture Notes in Math, vol. 1403, Springer, 1989, pp. 258-271.
10. L.R. Nielsen, Route Choice in Stochastic Time-Dependent Networks, Ph.D. Thesis, Department of Operations Research, University of Aarhus, 2004.
11. L.R. Nielsen, K.A. Andersen, and D. Pretolani Bicriterion shortest hyperpaths in random time-dependent networks IMA J. Management Math. 14 3 2003 271 303
12. L.R. Nielsen, K.A. Andersen, and D. Pretolani Finding the K shortest hyperpaths Comput. Oper. Res. 32 6 2005 1477 1497
13. D. Pretolani A directed hypergraph model for random time-dependent shortest paths Eur. J. Oper. Res. 123 2000 315 324
14. R.E. Tarjan, Data Structures and Network Algorithms, CBMS-NSF Conference Series, vol. 44, SIAM, 1983.