Reduction approaches for robust shortest path problems

Computers and Operations Research

Volumn 38, Issue 11, 2011, Pages 1610-1619

  Catanzaro, Daniele ^a   Labbé, Martine ^a   Salazar Neumann, Martha ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Interval data; Minimax regret optimization; Pegging test; Preprocessing; Robust optimization; Shortest path problem

Indexed keywords

INTERVAL DATA; MINIMAX REGRET OPTIMIZATION; PEGGING TEST; PREPROCESSING; ROBUST OPTIMIZATION; SHORTEST PATH PROBLEM;

COMBINATORIAL OPTIMIZATION; OPTIMAL SYSTEMS; PROBLEM SOLVING; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

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

References (11)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network flows 1993 Prentice-Hall Upper Saddle River, NJ
2. R. Montemanni, and L.M. Gambardella The robust shortest path problem with interval data via Benders' decomposition 4OR 3 2005 315 328 (Pubitemid 41818519)
3. P. Kouvelis, and G. Yu Robust discrete optimization and its applications 1997 Kluwer Academic Publishers Boston, MA
4. I. Averbakh, and V. Lebedev Interval data minmax regret network optimization problems Discrete Applied Mathematics 138 3 2004 289 301
5. P. Zielinski The computational complexity of the relative robust shortest path problem with interval data European Journal of Operations Research 158 2004 570 576
6. A. Kasperski, and P. Zielinski The robust shortest path problem in series-parallel miltidigraphs with interval data Operations Research Letters 34 2006 69 76 (Pubitemid 41688320)
7. Karasan OE, Pinar MC, Yaman H. The robust shortest path problem with interval data. Technical Report, Bilkent University. Ankara, Turkey, http://www.optimization-online.org ; 2001.
8. R. Montemanni, L.M. Gambardella, and A.V. Donati A branch-and-bound algorithm for the robust shortest path problem with interval data Operations Research Letters 32 2004 225 232
9. R. Montemanni, and L.M. Gambardella An exact algorithm for the robust shortest path problem with interval data Computers and Operations Research 31 2004 1667 1680 (Pubitemid 38485239)
10. D. Yokoya, C.W. Duin, and T. Yamada A reduction approach to the repeated assignment problem European Journal of Operations Research 210 2 2011 185 193 10.1016/j.ejor.2010.10.027
11. Salazar-Neumann M. Advances in robust combinatorial optimization and linear programming. PhD thesis, G.O.M., Université Libre de Bruxelles (U.L.B.), Brussels, Belgium; 2010.