A branch and bound algorithm for the robust spanning tree problem with interval data

European Journal of Operational Research

Volumn 161, Issue 3, 2005, Pages 771-779

  Montemanni, R ^a   Gambardella, L M ^a  

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

Author keywords

Branch and bound; Interval data; Robust optimization; Spanning tree problem

Indexed keywords

ALGORITHMS; COSTS; DATA REDUCTION; GRAPH THEORY; MOTIVATION; OPTIMIZATION; TELECOMMUNICATION NETWORKS;

BRANCH AND BOUNDS; INTERVAL DATA; ROBUST OPTIMIZATION; SPANNING TREE PROBLEMS;

ROBUSTNESS (CONTROL SYSTEMS);

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

References (12)

1. I. Aron, P. Van Hentenryck, A constraints satisfaction approach to the robust spanning tree problem with interval data, Computer Science Department, Brown University, May 2002, Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI'02), August 1-4, 2002, Edmonton, Canada.
2. I. Aron, P. Van Hentenryck, On the complexity of the robust spanning tree with interval data, Operations Research Letters 32 (2004) 36-40.
3. Bertsekas D.P., Gallagher R. Data Networks. 1987;Prentice-Hall, Englewood Cliffs, NJ.
4. Cayley A. A theorem on trees. Quarterly Journal of Pure and Applied Mathematics. 23:1889;376-378.
5. 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.
6. Gabow H.N. Two algorithms for generating weighted spanning trees in order. SIAM Journal on Computing. 6(1):1977;139-150.
7. Kouvelis P., Yu G. Robust Discrete Optimization and its Applications. 1997;Kluwer Academic Publishers.
8. Kozina G.L., Perepelista V.A. Interval spanning trees problem: Solvability and computational complexity. Interval Computations. 1:1994;42-50.
9. 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.
10. R. Montemanni, L.M. Gambardella, A.V. Donati, A branch and bound algorithm for the robust shortest path problem with interval data, Operations Research Letters 32 (2004) to be published.
11. Prim R.C. Shortest connection networks and some generalizations. Bell System Technical Journal. 36:1957;1389-1401.
12. Yaman H., Karaşan O.E., Pinar M.Ç. The robust spanning tree problem with interval data. Operations Research Letters. 29:2001;31-40.