Minimax regret spanning arborescences under uncertain costs

European Journal of Operational Research

Volumn 182, Issue 2, 2007, Pages 561-577

  Conde, Eduardo ^a   Candia, Alfredo ^b  

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSIDAD DE TALCA   (Chile)

Author keywords

Edmonds' algorithm; Minimum spanning arborescences; Robust optimization

Indexed keywords

HEURISTIC ALGORITHMS; OPERATING COSTS; OPTIMIZATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); STATISTICAL METHODS;

ARC COSTS; INTERVAL ESTIMATE; MINIMAX REGRET SPANNING ARBORESCENCES;

INDUSTRIAL MANAGEMENT;

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

References (41)

1. Adler M., and Mitzenmacher M. Towards compressing web graphs. Data Compression Conference DCC'01 (2001), IEEE 203-212
2. Alonso-Ayuso A., Detti P., Escudero L., and Ortuño M. On dual based lower bounds for the sequential ordering problem with precedences and due dates. Annals of Operations Research 124 (2003) 111-131
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. I. Aron, P. Van Hentenryck, A constraint satisfaction approach to the robust spanning tree with interval data, in: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI), August 2002.
5. Averbakh I. On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming 90 (2001) 263-272
6. Averbakh I. Complexity of robust single facility location problems on networks with uncertain edge lengths. Discrete Applied Mathematics 127 (2003) 505-522
7. Averbakh I., and Lebedev V. Interval data minmax regret network optimization problems. Discrete Applied Mathematics 138 (2004) 289-301
8. P. Basu, J. Redi, Effect of overhearing transmissions on energy efficiency in dense sensor networks, in: IPSN'04, ACM, April 26-27, 2004.
9. Beasley J.E. An SST-based algorithm for the Steiner problem in graphs. Networks 19 1 (1989) 1-16
10. Bertsekas D.P., and Gallagher R. Data Networks (1987), Prentice-Hall, Englewood Cliffs, NJ
11. Brânzei R., Mallozzi L., and Tijs S. Supermodular games and potential games. Journal of Mathematical Economics 39 (2003) 39-49
12. Camerini P., Fratta L., and Maffioli F. A note on finding optimum branchings. Networks 9 2 (1978) 309-312
13. Chu Y., and Liu T.H. On the shortest arborescence of a directed graph. Science Sinica 14 (1965) 1396-1400
14. Conde E. An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. Mathematical Programming 100 2 (2004) 345-353
15. Edmonds J. Optimum branching. Journal of Research National Bureau of Standards 71B (1967) 233-240
16. Fischetti M., and Toth P. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming 53 (1992) 173-197
17. Fischetti M., and Toth P. An efficient algorithm for the min-sum arborescence problem in complete digraphs. ORSA Journal on Computing 5 4 (1993) 426-434
18. Gabow H., Galil Z., Spencer T., and Tarjan R.E. Efficient algorithms for finding minimum spanning trees in undirected graphs. Combinatoria 6 2 (1986) 109-122
19. Gavish B. Topological design of centralized computer networks: Formulations and algorithms. Networks 12 (1982) 355-377
20. Gondran M., Minoux M., and Vajda S. Graphs and Algorithms (1984), John Wiley & Sons, Inc., New York, NY, USA
21. R. Guerin, A. Orda, QoS routing in networks with inaccurate information: Theory and algorithms, in: IEEE INFOCOM'97, Kobe, Japan, 1997, pp. 75-83.
22. Heckerman D., Geiger D., and Chickering D. Learning bayesian networks: The combination of knowledge and statistical data. Machine Learning 20 (1995) 197-243
23. Kasperski A., and Zieliński P. An approximation algorithm for interval data minmax regret combinatorial optimization problems. Information Processing Letters 97 (2006) 177-180
24. R. Kawatra, A hop constrained min-sum arborescence with outage costs, in: Proceedings of the 36th Hawai International Conference on Systems Sciences IEEE, HICSS'03, 2002.
25. Kececioglu J., and Myers E. Combinatorial algorithms for DNA sequence assembly. Algorithmica 13 1-2 (1995) 7-51
26. Kirchoff G. Über die auflösung der gleichungen, auf welche man bei der untersuchung der linearen verteilung galvanischer ströme geführt wird. Annals of Physics and Chemistry 72 (1847) 497-508
27. Kouvelis P., and Yu G. Robust Discrete Optimization and Its Applications (1997), Kluwer Academic Publisher, Boston
28. Kruskal J.B. On the shortest spanning tree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7 (1956) 48-50
29. Larson R., and Odoni A. Urban Operations Research (1981), Prentice-Hall, Englewood Cliffs
30. Lorenz D., and Orda A. QoS routing in networks with uncertain parameters. IEEE/ACM Transactions on Networking 6 (1998) 768-788
31. Montemanni R. A Benders decomposition approach for the robust spanning tree problem with interval data. European Journal of Operational Research 174 3 (2006) 1479-1490
32. 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
33. Papadimitriou I., and Georgiadis L. Energy-aware broadcasting in wireless networks. MONET 9 6 (2004) 567-581
34. Pelikan M., Goldberg D.E., and Cant-Paz E. Linkage problem, distribution estimation and bayesian networks. Evolutionary Computation 8 3 (2000) 311-340
35. Prim R.C. Shortest connection networks and some generalizations. Bell System Technology Journal 36 (1957) 1389-1401
36. Ribeiro C.C., and Souza M.C. Tabu search for the Steiner problem in graphs. Networks 36 (2000) 138-146
37. Tarjan R. Finding optimum branchings. Networks 7 (1977) 25-35
38. Tate S.R. Band ordering in lossless compression if multispectral images. IEEE Transactions on Computers 46 4 (1997) 477-483
39. Wan P., Calinescu G., and Yi Ch.W. Minimum-power multicast routing in static ad hoc networks. IEEE/ACM Transactions on Networking 12 3 (2004) 507-514
40. Yaman H., Karasan O.E., and Pinar M.C. The robust spanning tree problem with interval data. Operations Research Letters 29 1 (2001) 31-40
41. Zielinski P. The computational complexity of the relative robust spanning tree problem with interval data. European Journal of Operational Research 158 3 (2004) 570-576