{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:03:38Z","timestamp":1773270218389,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,21]],"date-time":"2006-07-21T00:00:00Z","timestamp":1153440000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,9,24]]},"DOI":"10.1007\/s10288-006-0015-3","type":"journal-article","created":{"date-parts":[[2006,7,20]],"date-time":"2006-07-20T05:44:58Z","timestamp":1153374298000},"page":"231-245","source":"Crossref","is-referenced-by-count":35,"title":["Compact linearization for binary quadratic problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Leo","family":"Liberti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s101070100233","volume":"91","author":"K Allemand","year":"2001","unstructured":"Allemand K, Fukuda K, Liebling TM, Steiner E.(2001) A polynomial case of unconstrained zero-one quadratic optimization. Math Program 91:49\u201352","journal-title":"Math Program"},{"issue":"4","key":"15_CR2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/12.762522","volume":"48","author":"R Battiti","year":"1999","unstructured":"Battiti R, Bertossi A. (1999) Greedy, prohibition and reactive heuristics for graph partitioning. IEEE Trans Comput 48(4):361\u2013385","journal-title":"IEEE Trans Comput"},{"key":"15_CR3","unstructured":"Beasley JE.(1998) Heuristic algorithms for the unconstrained binary quadratic programming problem. In: Technical report, Management School, Imperial College London"},{"key":"15_CR4","unstructured":"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\u00e9tiers"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/B:OPTE.0000038889.84284.c7","volume":"5","author":"M. Boulle","year":"2004","unstructured":"Boulle M. (2004) Compact mathematical formulation for graph partitioning. Optim Eng 5:315\u2013333","journal-title":"Optim Eng"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Caprara A, Lancia G.(2002) Structural alignment of large-size proteins via Lagrangian relaxation. In: Proceedings of 6th RECOMB ACM Press pp 100\u2013108.","DOI":"10.1145\/565196.565209"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1999","unstructured":"Caprara A, Pisinger D, Toth P. (1999) Exact solution of the quadratic knapsack problem. INFORMS J Comput 11:125\u2013137","journal-title":"INFORMS J Comput"},{"key":"15_CR8","unstructured":"Davidovi\u0107 T, Liberti L, Maculan N, Mladenovi\u0107 N. (2004) Mathematical programming-based approach to scheduling of communicating tasks. In: Technical Report G-2004-99, Cahiers du GERAD"},{"key":"15_CR9","first-page":"247","volume":"74","author":"CE Ferreira","year":"1996","unstructured":"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\u2013266","journal-title":"Math Program"},{"key":"15_CR10","first-page":"17","volume":"4","author":"R. Fortet","year":"1960","unstructured":"Fortet R. (1960) Applications de l\u2019alg\u00e8bre de boole en recherche op\u00e9rationelle. Revue Fran\u00e7aise Recherche Op\u00e9rationelle 4:17\u201326","journal-title":"Revue Fran\u00e7aise Recherche Op\u00e9rationelle"},{"key":"15_CR11","volume-title":"The AMPL book","author":"R Fourer","year":"2002","unstructured":"Fourer R, Gay D. (2002) The AMPL book. Duxbury Press, Pacific Grove"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0166-218X(83)90018-5","volume":"5","author":"AM Frieze","year":"1983","unstructured":"Frieze AM, Yadegar J. (1983) On the quadratic assignment problem. Discrete Appl Math 5:89\u201398","journal-title":"Discrete Appl Math"},{"key":"15_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean methods in operations research and related areas","author":"PL Hammer","year":"1968","unstructured":"Hammer PL, Rudeanu S. (1968) Boolean methods in operations research and related areas. Springer, Berlin, Heidelberg, New York"},{"issue":"6","key":"15_CR14","doi-asserted-by":"crossref","first-page":"2048","DOI":"10.1137\/S1064827598341475","volume":"21","author":"B Hendrickson","year":"2000","unstructured":"Hendrickson B, Kolda T. (2000) Partitioning rectangular and structurally nonsymmetric sparse matrices for parallel processing. SIAM J Sci Comput 21(6):2048\u20132072","journal-title":"SIAM J Sci Comput"},{"key":"15_CR15","unstructured":"ILOG (2002) ILOG CPLEX 8.0 User\u2019s Manual. ILOG S.A., Gentilly, France"},{"key":"15_CR16","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S Johnson","year":"1989","unstructured":"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\u2013892","journal-title":"Oper Res"},{"key":"15_CR17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans TC, Beckmann MJ. (1957) Assignment problems and the location of economic activities. Econometrica 25:53\u201376","journal-title":"Econometrica"},{"key":"15_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1379-3","volume-title":"Location, scheduling, design and integer programming","author":"MW Padberg","year":"1996","unstructured":"Padberg MW, Rijal MP. (1996) Location, scheduling, design and integer programming. Kluwer, Dordrecht"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013364. American Mathematical Society","DOI":"10.1090\/dimacs\/016\/17"},{"issue":"10","key":"15_CR20","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"HD Sherali","year":"1986","unstructured":"Sherali HD, Adams WP. (1986) A tight linearization and an algorithm for 0\u20131 quadratic programming problems. Manage Sci 32(10):1274\u20131290","journal-title":"Manage Sci"},{"key":"15_CR21","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(95)00060-5","volume":"68","author":"HD Sherali","year":"1996","unstructured":"Sherali HD, Lee Y. (1996) Tighter representations for set partitioning problems. Discrete Appl Math 68:153\u2013167","journal-title":"Discrete Appl Math"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0015-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0015-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0015-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:54Z","timestamp":1559117574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0015-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,21]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["15"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0015-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,21]]}}}