Abstract
We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0–1 mixed-integer problems subject to assignment constraints. The resulting linearized formulation is more compact and tighter than that obtained with a more usual linearization technique. We discuss the application of the compact linearization to three classes of problems in the literature, among which the graph partitioning problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Allemand K, Fukuda K, Liebling TM, Steiner E.(2001) A polynomial case of unconstrained zero-one quadratic optimization. Math Program 91:49–52
Battiti R, Bertossi A. (1999) Greedy, prohibition and reactive heuristics for graph partitioning. IEEE Trans Comput 48(4):361–385
Beasley JE.(1998) Heuristic algorithms for the unconstrained binary quadratic programming problem. In: Technical report, Management School, Imperial College London
Billionnet A, Elloumi S, Plateau M-C. (2006) Quadratic convex reformulation: a computational study of the graph bisection problem. In: Technical report RC1003, Conservatoire National des Arts et Métiers
Boulle M. (2004) Compact mathematical formulation for graph partitioning. Optim Eng 5:315–333
Caprara A, Lancia G.(2002) Structural alignment of large-size proteins via Lagrangian relaxation. In: Proceedings of 6th RECOMB ACM Press pp 100–108.
Caprara A, Pisinger D, Toth P. (1999) Exact solution of the quadratic knapsack problem. INFORMS J Comput 11:125–137
Davidović T, Liberti L, Maculan N, Mladenović N. (2004) Mathematical programming-based approach to scheduling of communicating tasks. In: Technical Report G-2004-99, Cahiers du GERAD
Ferreira CE, Martin A, Carvalho de Souza C, Weismantel R, Wolsey LA. (1996) Formulations and valid inequalities for the node capacitated graph partitioning problem. Math Program 74:247–266
Fortet R. (1960) Applications de l’algèbre de boole en recherche opérationelle. Revue Française Recherche Opérationelle 4:17–26
Fourer R, Gay D. (2002) The AMPL book. Duxbury Press, Pacific Grove
Frieze AM, Yadegar J. (1983) On the quadratic assignment problem. Discrete Appl Math 5:89–98
Hammer PL, Rudeanu S. (1968) Boolean methods in operations research and related areas. Springer, Berlin, Heidelberg, New York
Hendrickson B, Kolda T. (2000) Partitioning rectangular and structurally nonsymmetric sparse matrices for parallel processing. SIAM J Sci Comput 21(6):2048–2072
ILOG (2002) ILOG CPLEX 8.0 User’s Manual. ILOG S.A., Gentilly, France
Johnson D.S, Aragon CR, McGeoch LA, Schevon C. (1989) Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper Res 37:865–892
Koopmans TC, Beckmann MJ. (1957) Assignment problems and the location of economic activities. Econometrica 25:53–76
Padberg MW, Rijal MP. (1996) Location, scheduling, design and integer programming. Kluwer, Dordrecht
Sherali H, Brown E.(1994) A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem. In: Pardalos, P., Wolkowicz, H.: (eds) Quadratic Assignment and related problems. pp 343–364. American Mathematical Society
Sherali HD, Adams WP. (1986) A tight linearization and an algorithm for 0–1 quadratic programming problems. Manage Sci 32(10):1274–1290
Sherali HD, Lee Y. (1996) Tighter representations for set partitioning problems. Discrete Appl Math 68:153–167
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liberti, L. Compact linearization for binary quadratic problems. 4OR 5, 231–245 (2007). https://doi.org/10.1007/s10288-006-0015-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-006-0015-3