Complexity of the min-max and min-max regret assignment problems

Operations Research Letters

Volumn 33, Issue 6, 2005, Pages 634-640

  Aissi, Hassene ^a   Bazgan, Cristina ^a   Vanderpooten, Daniel ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Assignment problem; Complexity; Min max; Min max regret; NP hard

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS;

ASSIGNMENT PROBLEMS; COMPLEXITY; MIN-MAX; MIN-MAX REGRET; NP-HARD;

PROBLEM SOLVING;

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

References (11)

1. I.D. Aron, and P. Van Hentenryck On the complexity of the robust spanning tree with interval data Oper. Res. Lett. 32 2004 36 40
2. I. Averbakh Complexity of robust single facility location problems on networks with uncertain edge lengths Discrete Appl. Math. 127 2003 505 522
3. I. Averbakh Minmax regret linear resource allocation problems Oper. Res. Lett. 32 2004 174 180
4. I. Averbakh, and V. Lebedev Interval data min-max regret network optimization problems Discrete Appl. Math. 138 2004 289 301
5. M. Garey, D. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, 1979.
6. A.J. Hoffman, and H. Markowitz A note on shortest path, assignment and transportation problems Nav. Res. Logist. Quart. 10 1963 375 379
7. O.E. Karaşan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, 2001, available from http://www.optimization-online. org.
8. P. Kouvelis, and G. Yu Robust Discrete Optimization and its Application 1997 Kluwer Academic Publishers Boston
9. H.W. Kuhn The hungarian method for the assignment problem Nav. Res. Logist. Quart. 2 1955 83 97
10. H. Yaman, O.E. Karaşan, and M.C. Pinar The robust spanning tree problem with interval data Oper. Res. Lett. 29 2001 31 40
11. G. Yu, and O.J. Yang On the robust shortest path Comput. Oper. Res. 6 1998 457 468