A study of the quadratic semi-assignment polytope

Adams, 1986, A tight linearization and an algorithm for zero-one quadratic programming problems, Manage. Sci., 32, 1274, 10.1287/mnsc.32.10.1274 Barahona, 1989, Experiments in quadratic 0-1 programming, Math. Programm., 44, 127, 10.1007/BF01587084 Beasley, 1990, OR-Library, distributing test problems by electronic mail, J. Oper. Res. Soc., 41, 1069, 10.1057/jors.1990.166 Billionnet, 2001, Best reduction of the quadratic semi-assignment problem, Discrete Appl. Math., 109, 197, 10.1016/S0166-218X(00)00257-2 Bryan, 1999, Hub-and-spoke networks in air transportation: an analytical review, J. Regional Sci., 39, 275, 10.1111/1467-9787.00134 Carter, 1984, The indefinite zero-one quadratic problem, Discrete Appl. Math., 7, 23, 10.1016/0166-218X(84)90111-2 Deza, 1997 Ernst, 1998, Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem, European J. Oper. Res., 104, 100, 10.1016/S0377-2217(96)00340-2 Fujie, 2000, Stable set polytopes in a higher dimensional space, vol. V, 71 Hamacher, 2004, Adapting polyhedral properties from facility to hub location problems, Discrete Appl. Math., 145, 104, 10.1016/j.dam.2003.09.011 ILOG, 2007 Jünger, 2000, On the SQAP-polytope, SIAM J. Optim., 11, 444, 10.1137/S1052623496310576 Jünger, 2000, The QAP-polytope and the star transformation, Discrete Appl. Math., 111, 283, 10.1016/S0166-218X(00)00272-9 Jünger, 2001, Box-inequalities for quadratic assignment polytopes, Math. Programm., 91, 175, 10.1007/s101070100251 V. Kaibel, Polyhedral combinatorics of the quadratic assignment problem, Ph.D. Thesis, Universität zu Köln, 1997 Kleinberg, 2002, Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields, J. ACM, 49, 616, 10.1145/585265.585268 Koster, 1998, The partial constraint satisfaction problem: facets and lifting theorems, Oper. Res. Lett., 23, 89, 10.1016/S0167-6377(98)00043-1 Labbé, 2004, Projecting the flow variables for hub location problems, Networks, 44, 84, 10.1002/net.20019 Labbé, 2005, A branch and cut algorithm for hub location problems with single assignment, Math. Programm., 102, 371, 10.1007/s10107-004-0531-x Magirou, 1989, An algorithm for the multiprocessor assignment problem, Oper. Res. Lett., 8, 351, 10.1016/0167-6377(89)90022-9 Malucelli, 1996, A polynomially solvable class of the quadratic semi-assignment problems, European J. Oper. Res., 91, 619, 10.1016/0377-2217(95)00053-4 Malucelli, 1994, Quadratic semi-assignment problem on structured graphs, Ric. Oper., 69, 57 Malucelli, 1995, Lower bounds for the quadratic semi-assignment problem, European J. Oper. Res., 83, 365, 10.1016/0377-2217(95)00013-G O’Kelly, 1987, A quadratic integer program for the location of interacting hub facilities, European J. Oper. Res., 32, 393, 10.1016/S0377-2217(87)80007-3 Padberg, 1989, The Boolean quadric polytope : some characteristics, facets and relatives, Math. Programm., 45, 139, 10.1007/BF01589101 Saito, 2006, The symmetric quadratic semi-assignment polytope, IEICE Trans. Fundamentals, E89-A, 1227, 10.1093/ietfec/e89-a.5.1227 H. Saito, T. Fujie, T. Matsui, S. Matuura, The quadratic semi-assignment polytope, METR 2004-32, Mathematical Engineering Technical Reports, University of Tokyo, 2004. Available from: http://www.keisu.t.u-tokyo.ac.jp/Research/techrep.0.html Saito, 2002, A linear relaxation for hub network design problems, IEICE Trans. Fundamentals, E85-A, 1000 Sherali, 1995, A simultaneous lifting strategy for identifying new class of facets for Boolean quadric polytope, Oper. Res. Lett., 17, 19, 10.1016/0167-6377(94)00065-E Simone, 1989, The cut polytope and the Boolean quadric polytope, Discrete Math., 79, 71, 10.1016/0012-365X(90)90056-N Skutella, 2001, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM, 48, 206, 10.1145/375827.375840 Sohn, 2000, The single allocation problem in the interacting three-hub network, Networks, 35, 17, 10.1002/(SICI)1097-0037(200001)35:1<17::AID-NET2>3.0.CO;2-N Stone, 1977, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Softw. Eng., 3, 85, 10.1109/TSE.1977.233840 Towsley, 1986, Allocating programs containing branches and loops within a multiple processor system, IEEE Trans. Softw. Eng., 12, 1018, 10.1109/TSE.1986.6313018