A Branch and Bound algorithm for the minimax regret spanning arborescence

Journal of Global Optimization

Volumn 37, Issue 3, 2007, Pages 467-480

  Conde, Eduardo ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Branch and Bound algorithms; Robust optimization; Spanning arborescences

Indexed keywords

ALGORITHMS; COSTS; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

BRANCH AND BOUND ALGORITHMS; MINIMAX REGRET OPTIMIZATION; ROBUST OPTIMIZATION; SPANNING ARBORESCENCES;

GRAPH THEORY;

EID: 33846595137     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-006-9074-4     Document Type: Article

References (9)

1. Aron, I., Van Hentenryck, P.: On the complexity of the robust spanning tree with interval data. Oper. Res. Lett. 32(1), 136-140 (2003)
2. Aron, I., Van Hentenryck, P.: A constraint satisfaction approach to the robust spanning tree with interval data. Proceedings of the 18th conference on uncertainty in artificial intelligence (UAI), (August 2002)
3. Averbakh, I., Lebedev, V.: Interval data minmax regret network optimization problems. Discrete Applied Mathematics, 138, 289-301 (2004)
4. Conde, E., Candia, A.: Minimax regret spanning arborescences under uncertain costs. Eur. J. Operational Res. (in Press) (2006)
5. Edmonds, J.: Optimum branching. J. Res. Nat. Bureau of Standards, 71B 233-240 (1967)
6. Magnanti, T.L., Wolsey, L.: Optimal trees, in: Network models, handbook in operations research and management science. In: Ball, M.O. et al. (eds.), vol. 7, pp. 503-615. North-Holland Amsterdam (1995)
7. Montemanni, R.: A Benders decomposition approach for the robust spanning tree problem with interval data. Eur. J. Operational Res. 174(3), 1479-1490 (2006)
8. Montemanni, R., Gambardella, L.M.: A branch and bound algorithm for the robust spanning tree problem with interval data. Eur. J. Operational Res. 161(3), 771-779 (2005)
9. Yaman, H., Karasan, O.E., Pinar, M.Ç.: The robust spanning tree problem with interval data. Operations Res. Lett. 29(1), 31-40 (2001)