An enhanced exact procedure for the absolute robust shortest path problem

International Transactions in Operational Research

Volumn 17, Issue 2, 2010, Pages 207-220

  Bruni, Maria Elena ^a   Guerriero, Francesca ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Heuristic search; Robust optimization; Scenarios

Indexed keywords

EID: 84878738273     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2009.00702.x     Document Type: Article

References (17)

1. Averbakh, I., 2000. Minmax regret solutions for minimax optimization problems with uncertainty. Operations Research Letters 27, 57–65.
2. Averbakh, I., Lebedev, V., 2004. Interval data minmax regret network optimization problems. Discrete Applied Mathematics 138, 3, 289–301.
3. Gang, Y., Jian, Y., 1998. On the robust shortest path problem. Computers and Operations Research 25, 6, 457–468.
4. Hart, P.E., Nilsson, N.J., Raphael, B., 1968. A formal basis for the heuristic determination of minimum length paths. IEEE Transaction on System Science and Cybernetics SSCV-4, 100–107.
5. Karasan, O.E., Pinar, M.C., Yaman, H., 2001. The robust shortest path problem with interval data, Working Paper, Department of Industrial Engineering, Bilkent University, 06533 Bilkent, Ankara, Turkey.
6. Klingman, D., Napier, A., Stutz, J., 1974. NETGEN: A program for generating Large scale (Un)capacitated Assignment, transportation and Minimum-length flow network problems. Management Science 20, 812–822.
7. Kouvelis, G., Yu, G., 1997. Robust Discrete Optimization and its Applications. Non Convex Optimization and its Applications. Kluwer Academic Publishers, Amsterdam.
8. * search. Proceedings of IJCAI-05, 218–223.
9. Marshall, W., Olkin, I., 1979. Inequalities: Theory of Majorization and its Applications. Academic Press, London.
10. Montemanni, R., Gambardella, L.M., 2004. An exact algorithm for the robust shortest path problem with interval data. Computers and Operations Research 31, 10, 1667–1680.
11. Montemanni, R., Gambardella, L.M., 2005. The robust shortest path problem with interval data via Benders decomposition. 4OR 3, 4, 315–328.
12. Montemanni, R., Gambardella, L.M., Donati, A.V., 2004. A branch and bound algorithm for the robust shortest path problem with interval data. Operations Research Letters 32, 3, 225–232.
13. Murty, I., Her, S.S., 1992. Solving min–max shortest path problems on a network. Naval Research Logistics 39, 669–683.
14. Pearl, J., 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, MA.
15. Pióro, M., Medhi, D., 2004. Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, Amsterdam.
16. Sansó, B., Soriano, P., 1999. Telecommunications Network Planning. Springer, Berlin.
17. Sayin, S., Kouvelis, P., 2005. The multiobjective discrete optimization problem: A weighted min–max two-stage optimization approach and a bicriteria algorithm. Management Science 51, 10, 1572–1581.