A branch and bound algorithm for the robust shortest path problem with interval data

Operations Research Letters

Volumn 32, Issue 3, 2004, Pages 225-232

  Montemanni, R ^a   Gambardella, L M ^a   Donati, A V ^a  

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

Author keywords

Branch and bound; Interval data; Robust optimization; Shortest path problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; INTEGER PROGRAMMING; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

MIXED-INTEGER PROGRAMMING (MIP); TRANSPORTATION PROBLEMS;

OPERATIONS RESEARCH;

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

References (8)

1. Dias L.C., Cĺmaco J.N. Shortest path problems with partial information. models and algorithms for detecting dominance European J. Oper. Res. 121:2000;16-31.
2. Dijkstra E.W. A note on two problems in connection with graphs. Numer. Math. 1:1959;269-271.
3. O.E. Karaşan, M.Ç Pinar, H. Yaman, The robust shortest path problem with interval data, Comput. Oper. Res. (2002).
4. Kouvelis P., Yu G. Robust Discrete Optimization and its Applications. 1997;Kluwer Academic Publishers, Dordrecht.
5. R. Montemanni, L.M. Gambardella, An exact algorithm for the robust shortest path problem with interval data, Comput. Oper. Res., to appear.
6. Yaman H., Karaşan O.E., Pinar M.Ç. The robust spanning tree problem with interval data. Oper. Res. Lett. 29:2001;31-40.
7. Yu G., Yang J. On the robust shortest path problem. Comput. Oper. Res. 25(6):1998;457-468.
8. P. Zieliński, The computational complexity of the relative robust shortest path problem with interval data, European J. Oper. Res., to appear.