Interval data minmax regret network optimization problems

Discrete Applied Mathematics

Volumn 138, Issue 3, 2004, Pages 289-301

  Averbakh, Igor ^a   Lebedev, Vasilij ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b VOLGOGRAD STATE UNIVERSITY   (Russian Federation)

Author keywords

Minmax regret optimization; Shortest path; Spanning tree

Indexed keywords

COMBINATORIAL CIRCUITS; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

MINMAX REGRET OPTIMIZATION; SHORTEST PATHS; SPANNING TREES;

TREES (MATHEMATICS);

EID: 1642617399     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00462-1     Document Type: Article

References (10)

1. Ahuja R., Magnanti T., Orlin J. Network Flows: Theory, Algorithms, and Applications. 1993;Prentice Hall, Upper Saddle River, NJ.
2. Averbakh I. Minmax regret solutions for minimax optimization problems with uncertainty. Oper. Res. Lett. 27(2):2000;57-65.
3. Averbakh I. On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Programming. 90:2001;263-272.
4. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
5. Kouvelis P., Yu G. Robust discrete optimization and its applications. 1997;Kluwer Academic Publishers, Boston.
6. R. Möhring, Scheduling under uncertainty: optimizing against a randomizing adversary. Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Springer Lecture Notes in Computer Science, Vol. 1913, Springer, Berlin, 2000, pp. 15-26.
7. R. Montemanni, L.M. Gambardella, A branch-and-bound algorithm for the robust spanning tree problem with interval data, Presented at the Conference of the European Chapter on Combinatorial Optimization (ECCO), Lugano, Switzerland, May 30-June 1, 2002.
8. Mulvey J.M., Vanderbei R.J., Zenious S.A. Robust optimization of large scale systems. Oper. Res. 43(2):1995;264-281.
9. H. Yaman, O.E. Karasan, M. Pinar, Longest path problem with interval data, Technical Report 9908, Department of Industrial Engineering, Bilkent University, 06533 Bilkent, Ankara, Turkey, 1999.
10. H. Yaman, O.E. Karasan, M. Pinar, The robust spanning tree problem with interval data, Technical Report 9909, Department of Industrial Engineering, Bilkent University, 06533 Bilkent, Ankara, Turkey, 1999.