The robust shortest path problem with interval data via Benders decomposition

4OR

Volumn 3, Issue 4, 2005, Pages 315-328

  Montemanni, Roberto ^a   Gambardella, Luca Maria ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Benders decomposition; Interval data; Robust optimization; Shortest path problem

Indexed keywords

EID: 29244432824     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-005-0066-x     Document Type: Article

References (20)

1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms and applications. Prentice Hall, Englewood Cliffs, NJ, USA
2. Averbakh I, Lebedev V (2004) Interval data minmax regret network optimization problems. Discrete Applied Mathematics 138: 289-301
3. Benders JF (1962) Partitioning procedures for solving mixed integer variables programming problems. Numerische. Mathematik 4: 238-252
4. Cordeau J-F, Soumis F, Desrosiers J (2000) A Benders decomposition approach for the locomotive and car assignment problem. Transportation Science 34: 133-149
5. Cordeau J-F, Stojkovic G, Soumis F, Desrosiers J (2001) Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Science 35: 375-388
6. Dias LC, Clímaco JN (2000) Shortest path problems with partial information: models and algorithms for detecting dominance. European Journal of Operational Research 121: 16-31
7. Dijkstra EW (1959) A note on two problems in connection with graphs. Numerische Mathematik 1: 269-271
8. Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton, NJ, USA
9. Geoffrion AM (1972) Generalized Benders decomposition. Journal of Optimization Theory and Applications 10(4): 237-260
10. Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Management Science 20(5): 822-844
11. Karaşan OE, Pinar MÇ, Yaman H (2001) The robust shortest path problem with interval data. Bilkent University, Ankara, Turkey
12. Kouvelis P, Yu G (1997) Robust Discrete Optimization and its applications. Kluwer Academic Publishers, Norwell, MA, USA
13. Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research 29(3): 464-483
14. Magnanti TL, Mirchandani R, Wong RT (1986) Tailoring Benders decomposition for uncapacitated network design. Mathematical Programming Study 26: 112-154
15. McDaniel D, Devine M (1977) A modified Benders' partitioning algorithm for mixed integer programming. Management Science 24: 312-379
16. Montemanni R, Gambardella LM (2004) An exact algorithm for the robust shortest path problem with interval data. Computers and Operations Research 31(10): 1667-1680
17. Montemanni R, Gambardella LM, Donati AV (2004a) A branch and bound algorithm for the robust shortest path problem with interval data. Operations Research Letters 32(3): 225-232
18. Montemanni R, Gambardella LM, Donati AV (2004b) A comparison of two new exact algorithms for the robust shortest path problem. Proceedings of TRISTAN V - The Fifth Triennial Symposium on Transportation Analysis
19. Richardson R (1976) An optimization approach to routing aircraft. Transportation Science 10: 52-71
20. Yu G, Yang J (1998) On the robust shortest path problem. Computers and Operations Research 25(6): 457-468