A Benders decomposition approach for the robust spanning tree problem with interval data

European Journal of Operational Research

Volumn 174, Issue 3, 2006, Pages 1479-1490

  Montemanni, Roberto ^a  

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

Author keywords

Benders decomposition; Combinatorial optimization; Interval data; Minimum spanning tree; Robustness

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; DATA REDUCTION; DECOMPOSITION; MATHEMATICAL MODELS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION;

BENDERS DECOMPOSITION; COMBINATORIAL OPTIMIZATION; INTERVAL DATA; MINIMUM SPANNING TREE;

TREES (MATHEMATICS);

EID: 33747006672     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.02.060     Document Type: Article

References (31)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows: theory, algorithms and applications (1993), Prentice-Hall
2. I. Aron, P. Van Hentenryck. A constraints satisfaction approach to the robust spanning tree problem with interval data, in: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI), August 2002.
3. Aron I., and Van Hentenryck P. On the complexity of the robust spanning tree with interval data. Operations Research Letters 32 1 (2003) 136-140
4. Averbakh I. On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming (2001) 263-272
5. Benders J.F. Partitioning procedures for solving mixed integer variables programming problems. Numerische Mathematik 4 (1962) 238-252
6. Bertsekas D.P., and Gallagher R. Data networks (1987), Prentice-Hall, Englewood Cliffs, NJ
7. Cordeau J.-F., Laporte G., and Mercier A. A Benders decomposition approach for the locomotive and car assignment problem. Transportation Science 34 (2000) 133-149
8. Cordeau J.-F., Stojkovic G., Soumis F., and Desrosiers J. Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Science 35 (2001) 375-388
9. A.V. Donati, R. Montemanni, L.M. Gambardella, A.E. Rizzoli, Integration of a robust shortest path algorithm with a time dependent vehicle routing model and applications, in: Proceedings of CIMSA 2003, July 2003, pp. 26-31.
10. J.J. Dongarra, Performance of various computers using standard linear algebra software in a fortran environment. Technical Report CS-89-85, University of Tennessee, July 2003.
11. Geoffrion A.M. Generalized Benders decomposition. Journal of Optimization Theory and Applications 10 4 (1972) 237-260
12. Geoffrion A.M., and Graves G.W. Multicommodity distribution system design by Benders decomposition. Management Science 20 5 (1974) 822-844
13. O.E. Karaşan, M.Ç. Pinar, H. Yaman, The robust shortest path problem with interval data, Bilkent University, 2001.
14. Kouvelis P., and Yu G. Robust discrete optimization and its applications (1997), Kluwer Academic Publishers
15. Kozina G.L., and Perepelista V.A. Interval spanning trees problem: Solvability and computational complexity. Interval Computations 1 (1994) 42-50
16. Kruskal J.B. On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of the American Mathematical Society 7 (1956) 48-50
17. Magnanti T.L., Mirchandani R., and Wong R.T. Tailoring Benders decomposition for uncapacitated network design. Mathematical Programming Study 26 (1986) 112-154
18. Magnanti T.L., and Wolsey L. Optimal trees. In: Ball M.O., et al. (Ed). Handbook in operations research and management science vol. 7 (1995), North Holland, Amsterdam 503-615
19. Magnanti T.L., and Wong R.T. Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research 29 3 (1981) 464-483
20. McDaniel D., and Devine M. A modified Benders' partitioning algorithm for mixed integer programming. Management Science 24 (1977) 312-379
21. Montemanni R., and Gambardella L.M. An exact algorithm for the robust shortest path problem with interval data. Computers and Operations Research 31 10 (2004) 1667-1680
22. R. Montemanni, L.M. Gambardella. The robust shortest path problem with interval data via Benders decomposition, European Journal of Operational Research, to appear.
23. Montemanni R., and Gambardella L.M. A branch and bound algorithm for the robust spanning tree problem with interval data. European Journal of Operational Research 161 3 (2005) 771-779
24. Montemanni R., Gambardella L.M., and Donati A.V. A branch and bound algorithm for the robust shortest path problem with interval data. Operations Research Letters 32 3 (2004) 225-232
25. R. Montemanni, L.M. Gambardella, A.V. Donati. A comparison of two new exact algorithms for the robust shortest path problem, in: Proceedings of TRISTAN V-The Fifth TRIennial Symposium on Transportation ANalysis, June 2004.
26. Prim R.C. Shortest connection networks and some generalizations. Bell System Technical Journal 36 (1957) 1389-1401
27. Richardson R. An optimization approach to routing aircraft. Transportation Science 10 (1976) 52-71
28. Yaman H., Karaşan O.E., and Pinar M.C. The robust spanning tree problem with interval data. Operations Research Letters 29 (2001) 31-40
29. H. Yaman, O.E. Karaşan, M.Ç. Pinar, Restricted robust optimization for maximization over uniform matroid with interval data uncertainty, Bilkent University, 2004.
30. Yu G., and Yang J. On the robust shortest path problem. Computers and Operations Research 25 6 (1998) 457-468
31. Zieliński P. The computational complexity of the relative robust shortest path problem with interval data. European Journal of Operational Research 158 3 (2004) 570-576