{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T14:57:26Z","timestamp":1721141846331},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,12,2]],"date-time":"2017-12-02T00:00:00Z","timestamp":1512172800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10288-017-0364-0","type":"journal-article","created":{"date-parts":[[2017,12,2]],"date-time":"2017-12-02T05:52:33Z","timestamp":1512193953000},"page":"295-309","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Compact linearization for binary quadratic problems subject to assignment constraints"],"prefix":"10.1007","volume":"16","author":[{"given":"Sven","family":"Mallach","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,2]]},"reference":[{"issue":"10","key":"364_CR1","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams WP, Sherali HD (1986) A tight linearization and an algorithm for zero-one quadratic programming problems. Manag Sci 32(10):1274\u20131290. https:\/\/doi.org\/10.1287\/mnsc.32.10.1274","journal-title":"Manag Sci"},{"key":"364_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A reformulation-linearization technique for solving discrete and continuous nonconvex problems, nonconvex optimization and its applications","author":"WP Adams","year":"1999","unstructured":"Adams WP, Sherali HD (1999) A reformulation-linearization technique for solving discrete and continuous nonconvex problems, nonconvex optimization and its applications. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-1-4757-4388-3"},{"issue":"1","key":"364_CR3","doi-asserted-by":"publisher","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 Progr 91(1):49\u201352. https:\/\/doi.org\/10.1007\/s101070100233","journal-title":"Math Progr"},{"key":"364_CR4","unstructured":"Balas E (1964) Extension de l\u2019algorithme additif \u00e0 la programmation en nombres entiers et \u00e0 la programmation non lin\u00e9aire. Comptes rendus de l\u2019Acad\u00e9mie des Sciences Paris 258:3136\u20135139"},{"issue":"1","key":"364_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E Balas","year":"1984","unstructured":"Balas E, Mazzola JB (1984) Nonlinear 0\u20131 programming: I. Linearization techniques. Math Progr 30(1):1\u201321. https:\/\/doi.org\/10.1007\/BF02591796","journal-title":"Math Progr"},{"key":"364_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-87477-5_5","volume-title":"Linear reformulations of integer quadratic programs","author":"A Billionnet","year":"2008","unstructured":"Billionnet A, Elloumi S, Lambert A (2008) Linear reformulations of integer quadratic programs. Springer, Berlin, pp 43\u201351. https:\/\/doi.org\/10.1007\/978-3-540-87477-5_5"},{"issue":"3","key":"364_CR7","doi-asserted-by":"publisher","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(3):315\u2013333. https:\/\/doi.org\/10.1023\/B:OPTE.0000038889.84284.c7","journal-title":"Optim Eng"},{"issue":"2","key":"364_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"TN Bui","year":"1987","unstructured":"Bui TN, Leighton FT, Chaudhuri S, Sipser M (1987) Graph bisection algorithms with good average case behavior. Combinatorica 7(2):171\u2013191. https:\/\/doi.org\/10.1007\/BF02579448","journal-title":"Combinatorica"},{"issue":"6","key":"364_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse W, Pardalos PM, Prokopyev OA (2004) A new linearization technique for multi-quadratic 0\u20131 programming problems. Oper Res Lett 32(6):517\u2013522. https:\/\/doi.org\/10.1016\/j.orl.2004.03.005","journal-title":"Oper Res Lett"},{"key":"364_CR10","first-page":"5","volume":"1","author":"R Fortet","year":"1959","unstructured":"Fortet R (1959) L\u2019alg\u00e8bre de boole et ses applications en recherche op\u00e9rationnelle. Cahiers du Centre d\u2019Etudes de Recherche Op\u00e9rationnelle 1:5\u201336","journal-title":"Cahiers du Centre d\u2019Etudes de Recherche Op\u00e9rationnelle"},{"key":"364_CR11","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet R (1960) Applications de l\u2019alg\u00e8bre de boole en recherche op\u00e9rationnelle. Revue de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle 4:17\u201326","journal-title":"Revue de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle"},{"issue":"1","key":"364_CR12","doi-asserted-by":"publisher","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(1):89\u201398. https:\/\/doi.org\/10.1016\/0166-218X(83)90018-5","journal-title":"Discrete Appl Math"},{"key":"364_CR13","unstructured":"Furini F, Traversi E (2013) Extended linear formulation for binary quadratic problems. Optim Online"},{"issue":"4","key":"364_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover F (1975) Improved linear integer programming formulations of nonlinear integer problems. Manag Sci 22(4):455\u2013460. https:\/\/doi.org\/10.1287\/mnsc.22.4.455","journal-title":"Manag Sci"},{"issue":"1","key":"364_CR15","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F Glover","year":"1973","unstructured":"Glover F, Woolsey E (1973) Further reduction of zero-one polynomial programming problems to zero-one linear programming problems. Oper Res 21(1):156\u2013161","journal-title":"Oper Res"},{"issue":"1","key":"364_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover F, Woolsey E (1974) Converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper Res 22(1):180\u2013182. https:\/\/doi.org\/10.1287\/opre.22.1.180","journal-title":"Oper Res"},{"issue":"6","key":"364_CR17","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/j.dam.2008.01.028","volume":"157","author":"S Gueye","year":"2009","unstructured":"Gueye S, Michelon P (2009) A linearization framework for unconstrained quadratic (0\u20131) problems. Discrete Appl Math 157(6):1255\u20131266. https:\/\/doi.org\/10.1016\/j.dam.2008.01.028","journal-title":"Discrete Appl Math"},{"key":"364_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean methods in operations research and related areas. \u00d6konometrie und Unternehmensforschung\/Econometrics and Operations Research","author":"PL Hammer","year":"1968","unstructured":"Hammer PL, Rudeanu S (1968) Boolean methods in operations research and related areas. \u00d6konometrie und Unternehmensforschung\/Econometrics and Operations Research. \u00d6konometrie und Unternehmensforschung\/Econometrics and Operations Research, Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-85823-9"},{"issue":"6","key":"364_CR19","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1016\/j.dam.2007.12.008","volume":"157","author":"P Hansen","year":"2009","unstructured":"Hansen P, Meyer C (2009) Improved compact linearizations for the unconstrained quadratic 0\u20131 minimization problem. Discrete Appl Math 157(6):1267\u20131290. https:\/\/doi.org\/10.1016\/j.dam.2007.12.008","journal-title":"Discrete Appl Math"},{"issue":"3","key":"364_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10288-006-0015-3","volume":"5","author":"L Liberti","year":"2007","unstructured":"Liberti L (2007) Compact linearization for binary quadratic problems. 4OR 5(3):231\u2013245. https:\/\/doi.org\/10.1007\/s10288-006-0015-3","journal-title":"4OR"},{"key":"364_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York, NY"},{"issue":"1\u2013supplement\u20131","key":"364_CR22","doi-asserted-by":"publisher","first-page":"S109","DOI":"10.1287\/opre.40.1.S109","volume":"40","author":"M Oral","year":"1992","unstructured":"Oral M, Kettani O (1992a) A linearization procedure for quadratic and cubic mixed-integer problems. Oper Res 40(1\u2013supplement\u20131):S109\u2013S116. https:\/\/doi.org\/10.1287\/opre.40.1.S109","journal-title":"Oper Res"},{"issue":"2","key":"364_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(92)90210-Z","volume":"58","author":"M Oral","year":"1992","unstructured":"Oral M, Kettani O (1992b) Reformulating nonlinear combinatorial optimization problems for highercomputational efficiency. Eur J Oper Res 58(2):236\u2013249. https:\/\/doi.org\/10.1016\/0377-2217(92)90210-Z","journal-title":"Eur J Oper Res"},{"issue":"4","key":"364_CR24","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S Sahni","year":"1974","unstructured":"Sahni S (1974) Computationally related problems. SIAM J Comput 3(4):262\u2013279. https:\/\/doi.org\/10.1137\/0203021","journal-title":"SIAM J Comput"},{"issue":"3","key":"364_CR25","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. JACM 23(3):555\u2013565. https:\/\/doi.org\/10.1145\/321958.321975","journal-title":"JACM"},{"issue":"1","key":"364_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11590-006-0019-0","volume":"1","author":"HD Sherali","year":"2007","unstructured":"Sherali HD, Smith JC (2007) An improved linearization strategy for zero-one quadratic programming problems. Optim Lett 1(1):33\u201347. https:\/\/doi.org\/10.1007\/s11590-006-0019-0","journal-title":"Optim Lett"},{"key":"364_CR27","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"LJ Watters","year":"1967","unstructured":"Watters LJ (1967) Reduction of integer polynomial programming problems to zero-one linear programming problems. Oper Res 15:1171\u20131174","journal-title":"Oper Res"},{"key":"364_CR28","first-page":"23","volume":"5","author":"WI Zangwill","year":"1965","unstructured":"Zangwill WI (1965) Media selection by decision programming. J Advert Res 5:23\u201337","journal-title":"J Advert Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-017-0364-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0364-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0364-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T16:11:27Z","timestamp":1693325487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-017-0364-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,2]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["364"],"URL":"https:\/\/doi.org\/10.1007\/s10288-017-0364-0","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,2]]}}}