On the robust assignment problem under a fixed number of cost scenarios

Operations Research Letters

Volumn 34, Issue 2, 2006, Pages 175-179

  Deǐneko, Vladimir G ^a   Woeginger, Gerhard J ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Assignment problem; Computational complexity; Robust optimization

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

ASSIGNMENT PROBLEM; ROBUST OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 29144452938     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.04.003     Document Type: Article

References (9)

1. H. Aissi, C. Bazgan, D. Vanderpooten, Complexity of the min-max and min-max regret assignment problems, Oper. Res. Lett. (2005), to appear.
2. F. Barahona, and W.R. Pulleyblank Exact arborescences, matchings, and cycles Discrete Appl. Math. 16 1987 91 99
3. A.V. Karzanov, Maximum matching of given weight in complete and complete bipartite graphs, Cybernetics 23 (1987) 8-13;
4. translation from Kibernetika 1 (1987) 7-11.
5. P. Kouvelis, and G. Yu Robust Discrete Optimization and its Applications 1997 Kluwer Academic Publishers Boston
6. M. Leclerc, Polynomial time algorithms for exact matching problems, Master's Thesis, University of Waterloo, Waterloo, 1986.
7. M. Leclerc Optimizing over a slice of the bipartite matching polytope Discrete Math. 73 1988/89 159 162
8. K. Mulmuley, U. Vazirani, and V.V. Vazirani Matching is as easy as matrix inversion Combinatorica 7 1987 105 113
9. C.H. Papadimitriou, and M. Yannakakis The complexity of restricted spanning tree problems J. ACM 29 1982 285 309