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

Aron, 2004, On the complexity of the robust spanning tree with interval data, Oper. Res. Lett., 32, 36, 10.1016/S0167-6377(03)00058-0 Averbakh, 2003, Complexity of robust single facility location problems on networks with uncertain edge lengths, Discrete Appl. Math., 127, 505, 10.1016/S0166-218X(02)00384-0 Averbakh, 2004, Minmax regret linear resource allocation problems, Oper. Res. Lett., 32, 174, 10.1016/S0167-6377(03)00091-9 Averbakh, 2004, Interval data min–max regret network optimization problems, Discrete Appl. Math., 138, 289, 10.1016/S0166-218X(03)00462-1 M. Garey, D. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, 1979. Hoffman, 1963, A note on shortest path, assignment and transportation problems, Nav. Res. Logist. Quart., 10, 375, 10.1002/nav.3800100132 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. Kouvelis, 1997, 10.1007/978-1-4757-2620-6 Kuhn, 1955, The hungarian method for the assignment problem, Nav. Res. Logist. Quart., 2, 83, 10.1002/nav.3800020109 Yaman, 2001, The robust spanning tree problem with interval data, Oper. Res. Lett., 29, 31, 10.1016/S0167-6377(01)00078-5 Yu, 1998, On the robust shortest path, Comput. Oper. Res., 6, 457, 10.1016/S0305-0548(97)00085-3