The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows

References

• Aissi H, Bazgan C, Vanderpooten D (2005) Complexity of the min–max and min–max regret assignment problems. Oper. Res. Lett. 33(6):634–640.Crossref, Google Scholar
• Aissi H, Bazgan C, Vanderpooten D (2009) Min–max and min–max regret versions of combinatorial optimization problems: A survey. Eur. J. Oper. Res. 197(2):427–438.Crossref, Google Scholar
• Averbakh I (2001) On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Programming 90(2):263–272.Crossref, Google Scholar
• Averbakh I, Lebedev V (2004) Interval data minmax regret network optimization problems. Discrete Appl. Math. 138(3):289–301.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Burkard R, Dell'Amico M, Martello S (2009) Assignment Problems (SIAM, Philadelphia).Crossref, Google Scholar
• Cela E (1998) The Quadratic Assignment Problem: Theory and Algorithms (Kluwer Academic, Dordrecht, the Netherlands).Crossref, Google Scholar
• Conde E (2004) An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. Math. Programming 100(2):345–353.Crossref, Google Scholar
• Conde E (2010) A 2-approximation for minmax regret problems via a mid-point scenario optimal solution. Oper. Res. Lett. 38(4):326–327.Crossref, Google Scholar
• Conde E (2012) On a constant factor approximation for minmax regret problems using a symmetry point scenario. Eur. J. Oper. Res. 219(2):452–457.Crossref, Google Scholar
• Glover F (1989) Tabu search—Part I. ORSA J. Comput. 1(3):190–206.Link, Google Scholar
• Glover F (1990) Tabu search—Part II. ORSA J. Comput. 2(1):4–32.Link, Google Scholar
• Kasperski A (2008) Discrete Optimization with Interval Data: Minmax Regret and Fuzzy Approach (Springer, Berlin, Heidelberg).Google Scholar
• Kasperski A, Zieliński P (2006) The robust shortest path problem in series-parallel multidigraphs with interval data. Oper. Res. Lett. 34(1):69–76.Crossref, Google Scholar
• Kasperski A, Zieliński P (2009) On the approximability of minmax (regret) network optimization problems. Inform. Processing Lett. 109(5):262–266.Crossref, Google Scholar
• Kasperski A, Zieliński P (2011) On the approximability of robust spanning tree problems. Theoret. Comput. Sci. 412(4):365–374.Crossref, Google Scholar
• Kaufman L, Broeckx F (1978) An algorithm for the quadratic assignment problem using Benders decomposition. Eur. J. Oper. Res. 2(3):207–211.Crossref, Google Scholar
• Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica: J. Econometric Soc. 25:53–76.Crossref, Google Scholar
• Lawler EL (1963) The quadratic assignment problem. Management Sci. 9(4):586–599.Link, Google Scholar
• Montemanni R (2006) A Benders decomposition approach for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 174(3):1479–1490.Crossref, Google Scholar
• Montemanni R, Gambardella LM (2005) The robust shortest path problem with interval data via Benders decomposition. 4OR 3(4):315–328.Crossref, Google Scholar
• Montemanni R, Gambardella LM, Donati AV (2004) A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett. 32(3):225–232.Crossref, Google Scholar
• Montemanni R, Barta J, Mastrolilli M, Gambardella LM (2007) The robust traveling salesman problem with interval data. Transportation Sci. 41(3):366–381.Link, Google Scholar
• Pereira J, Averbakh I (2011) Exact and heuristic algorithms for the interval data robust assignment problem. Comput. Oper. Res. 38(3):1153–1163.Crossref, Google Scholar
• Pereira J, Averbakh I (2013) The robust set covering problem with interval data. Ann. Oper. Res. 207(1):217–235.Crossref, Google Scholar
• Rei W, Cordeau J-F, Gendreau M, Soriano P (2009) Accelerating Benders decomposition by local branching. INFORMS J. Comput. 21(2):333–345.Link, Google Scholar
• Sahni S, Gonzalez T (1976) P-complete approximation problems. J. ACM 23(3):555–565.Crossref, Google Scholar
• Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4):443–455.Crossref, Google Scholar
• Xia Y, Yuan YX (2006) A new linearization method for quadratic assignment problems. Optim. Methods Software 21(5):805–818.Crossref, Google Scholar
• Yaman H, Karaşan OE, Pınar MÇ (2001) The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1):31–40.Crossref, Google Scholar
• Yaman H, Karaşan OE, Pınar MÇ (2007) Restricted robust uniform matroid maximization under interval uncertainty. Math. Programming 110(2):431–441.Crossref, Google Scholar
• Zhang H, Beltran-Royo C, Ma L (2013) Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers. Ann. Oper. Res. 207(1):261–278.Crossref, Google Scholar
• Zieliński P (2004) The computational complexity of the relative robust shortest path problem with interval data. Eur. J. Oper. Res. 158(3):570–576.Crossref, Google Scholar