{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:55:04Z","timestamp":1777694104628,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T00:00:00Z","timestamp":1422057600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10107-015-0863-8","type":"journal-article","created":{"date-parts":[[2015,1,23]],"date-time":"2015-01-23T16:55:31Z","timestamp":1422032131000},"page":"639-658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cutting planes for RLT relaxations of mixed 0\u20131 polynomial programs"],"prefix":"10.1007","volume":"151","author":[{"given":"Franklin Djeumou","family":"Fomeni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Kaparis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam N.","family":"Letchford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,24]]},"reference":[{"key":"863_CR1","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","volume":"180","author":"WP Adams","year":"2007","unstructured":"Adams, W.P., Guignard, M., Hahn, P.M., Hightower, W.L.: A level-2 reformulation\u2013linearization technique bound for the quadratic assignment problem. Eur. J. Oper. Res. 180, 983\u2013996 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"863_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M., Reinelt, G.: Experiments in quadratic 0\u20131 programming. Math. Program. 44, 127\u2013137 (1989)","journal-title":"Math. Program."},{"key":"863_CR3","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","volume":"92","author":"A Billionnet","year":"1996","unstructured":"Billionnet, A., Calmels, F.: Linear programming for the 0\u20131 quadratic knapsack problem. Eur. J. Oper. Res. 92, 310\u2013325 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"863_CR4","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.disopt.2005.08.006","volume":"2","author":"P Bonami","year":"2005","unstructured":"Bonami, P., Minoux, M.: Using rank-1 lift-and-project closures to generate cuts for 0\u20131 MIPs, a computational investigation. Discrete Optim. 2, 288\u2013307 (2005)","journal-title":"Discrete Optim."},{"key":"863_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1998","unstructured":"Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11, 125\u2013137 (1998)","journal-title":"INFORMS J. Comput."},{"key":"863_CR6","unstructured":"Christof, T., Loebl, A.: PORTA (polyhedron representation transformation algorithm). Software package, available for download at http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software"},{"key":"863_CR7","volume-title":"Deterministic Global Optimization: Theory, Algorithms and Applications","author":"CA Floudas","year":"1999","unstructured":"Floudas, C.A.: Deterministic Global Optimization: Theory, Algorithms and Applications. Kluwer, Dordrecht (1999)"},{"key":"863_CR8","unstructured":"Fukuda, K.: cdd (C double description program). Software package, available for download at: http:\/\/www.cs.mcgill.ca\/~fukuda\/soft\/cdd_home"},{"key":"863_CR9","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P.L., Simeone, B.: Quadratic knapsack problems. Math. Program. Stud. 12, 132\u2013149 (1980)","journal-title":"Math. Program. Stud."},{"key":"863_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.J.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"863_CR11","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/ijoc.1110.0450","volume":"24","author":"PM Hahn","year":"2012","unstructured":"Hahn, P.M., Zhu, Y.-R., Guignard, M., Hightower, W.L., Saltzman, M.J.: A level-3 reformulation\u2013linearization technique-based bound for the quadratic assignment problem. INFORMS J. Comput. 24, 202\u2013209 (2012)","journal-title":"INFORMS J. Comput."},{"key":"863_CR12","first-page":"291","volume":"82","author":"C Helmberg","year":"1998","unstructured":"Helmberg, C., Rendl, F.: Solving quadratic (0, 1)-programs by semidefinite programs and cutting planes. Math. Program. 82, 291\u2013315 (1998)","journal-title":"Math. Program."},{"key":"863_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0377-2217(99)00449-X","volume":"131","author":"M Hunting","year":"2001","unstructured":"Hunting, M., Faigle, U., Kern, W.: A Lagrangean relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. 131, 119\u2013131 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"863_CR14","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"863_CR15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.J.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"863_CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"MW Padberg","year":"1989","unstructured":"Padberg, M.W.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45, 139\u2013172 (1989)","journal-title":"Math. Program."},{"key":"863_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96, 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"863_CR18","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem\u2014a survey. Discrete Appl. Math. 155, 623\u2013648 (2007)","journal-title":"Discrete Appl. Math."},{"key":"863_CR19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.disopt.2008.08.003","volume":"6","author":"H Saito","year":"2009","unstructured":"Saito, H., Fujie, T., Matsui, T., Matuura, S.: A study of the quadratic semi-assignment polytope. Discrete Optim. 6, 37\u201350 (2009)","journal-title":"Discrete Optim."},{"key":"863_CR20","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.: A hierarchy of relaxations between the continuous and convex hull representations for 0\u20131 programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"863_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation\u2013linearization technique. J. Glob. Optim. 2, 101\u2013112 (1992)","journal-title":"J. Glob. Optim."},{"key":"863_CR22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52, 83\u2013106 (1994)","journal-title":"Discrete Appl. Math."},{"key":"863_CR23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(95)00060-5","volume":"68","author":"HD Sherali","year":"1996","unstructured":"Sherali, H.D., Lee, Y.: Tighter representations for set partitioning problems. Discrete Appl. Math. 68, 153\u2013167 (1996)","journal-title":"Discrete Appl. Math."},{"key":"863_CR24","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1998","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht (1998)"},{"key":"863_CR25","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10479-006-0107-7","volume":"149","author":"HD Sherali","year":"2007","unstructured":"Sherali, H.D.: RLT: A unified approach for discrete and continuous nonconvex optimization. Ann. Oper. Res. 149, 185\u2013193 (2007)","journal-title":"Ann. Oper. Res."},{"key":"863_CR26","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming","author":"M Tawarmalani","year":"2003","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Kluwer, Dortrecht (2003)"},{"key":"863_CR27","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008293029350","volume":"13","author":"Y Yajima","year":"1998","unstructured":"Yajima, Y., Fujie, T.: A polyhedral approach for nonconvex quadratic programming problems with box constraints. J. Glob. Optim. 13, 151\u2013170 (1998)","journal-title":"J. Glob. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0863-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0863-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0863-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:06Z","timestamp":1559124006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0863-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,24]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["863"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0863-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,24]]}}}