{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:24:12Z","timestamp":1774369452086,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,9,30]],"date-time":"2011-09-30T00:00:00Z","timestamp":1317340800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10479-011-0969-1","type":"journal-article","created":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T07:21:36Z","timestamp":1317280896000},"page":"33-49","source":"Crossref","is-referenced-by-count":10,"title":["Combining QCR and CHR for convex quadratic pure 0\u20131 programming problems with linear constraints"],"prefix":"10.1007","volume":"199","author":[{"given":"Aykut","family":"Ahlat\u00e7\u0131o\u011flu","sequence":"first","affiliation":[]},{"given":"Michael","family":"Bussieck","sequence":"additional","affiliation":[]},{"given":"Mustafa","family":"Esen","sequence":"additional","affiliation":[]},{"given":"Monique","family":"Guignard","sequence":"additional","affiliation":[]},{"given":"Jan-Hendrick","family":"Jagla","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Meeraus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,30]]},"reference":[{"key":"969_CR1","unstructured":"Ahn, S. (1997). On solving some optimization problems in stochastic and integer programming with applications in finance and banking. Ph.D. dissertation, University of Pennsylvania."},{"key":"969_CR2","unstructured":"Ahlat\u00e7\u0131o\u011flu, A. (2007). The convex hull relaxation for nonlinear integer programs with linear constraints. Summer paper, OPIM Dept., Univ. of Pennsylvania. Now subsumed by Ahlat\u00e7\u0131o\u011flu and Guignard."},{"key":"969_CR3","unstructured":"Ahlat\u00e7\u0131o\u011flu, A., & Guignard, M. (2007). The convex hull relaxation for nonlinear integer programs with linear constraints. OPIM Department Report (revised 2008)."},{"key":"969_CR4","unstructured":"Ahlat\u00e7\u0131o\u011flu, A., & Guignard, M. (2010). The convex hull relaxation (CHR) for convex and nonconvex MINLP problems with linear constraints. OPIM Dept. Report, Univ. of Pennsylvania."},{"key":"969_CR5","unstructured":"Albornoz, V. (1998). Dise\u00f1o de modelos y algoritmos de optimizaci\u00f3n robusta y su aplicaci\u00f3n a la planificaci\u00f3n agregada de la producci\u00f3n. Doctoral Dissertation, Universidad Catolica de Chile, Santiago, Chile."},{"key":"969_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A. Billionnet","year":"2007","unstructured":"Billionnet, A., & Elloumi, S. (2007). Using a mixed-integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Mathematical Programming, Series A, 109, 55\u201368.","journal-title":"Mathematical Programming, Series A"},{"key":"969_CR7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1051\/ro:2008011","volume":"42","author":"A. Billionnet","year":"2008","unstructured":"Billionnet, A., Elloumi, S., & Plateau, M.-C. (2008). Quadratic 0\u20131 programming: tightening linear or quadratic convex reformulation by use of relaxations. RAIRO. Recherche Op\u00e9rationnelle, 42, 103\u2013121.","journal-title":"RAIRO. Recherche Op\u00e9rationnelle"},{"key":"969_CR8","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A. Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., & Plateau, M.-C. (2009). Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: the QCR method. Discrete Applied Mathematics, 157, 1185\u20131197.","journal-title":"Discrete Applied Mathematics"},{"key":"969_CR9","unstructured":"Contesse, L., & Guignard, M. (1995). An augmented Lagrangean relaxation for nonlinear integer programming solved by the method of multipliers, Part I, Theory and algorithms. Working Paper, OPIM Department, University of Pennsylvania, latest revision 2009."},{"issue":"1\u20132","key":"969_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M. Frank","year":"1956","unstructured":"Frank, M., & Wolfe, P. (1956). An algorithm for quadratic programming. Naval Research Quarterly, 3(1\u20132), 95\u2013109.","journal-title":"Naval Research Quarterly"},{"key":"969_CR11","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A. M. Geoffrion","year":"1974","unstructured":"Geoffrion, A. M. (1974). Lagrangean relaxation for integer programming. Mathematical Programming Studies, 2, 82\u2013114.","journal-title":"Mathematical Programming Studies"},{"key":"969_CR12","unstructured":"Guignard, M. (1994). Primal relaxation in integer programming. VII CLAIO Meeting, Santiago, Chile, 1994, also Operations and Information Management Working Paper 94-02-01, University of Pennsylvania."},{"issue":"2","key":"969_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M. Guignard","year":"2003","unstructured":"Guignard, M. (2003). Lagrangean relaxation. Top, 11(2), 151\u2013228.","journal-title":"Top"},{"key":"969_CR14","unstructured":"Guignard, M. (2007a). Extension to the Plateau convexification method for nonconvex quadratic 0\u20131 programs. OPIM Department Research Paper 07-09-21, University of Pennsylvania."},{"key":"969_CR15","unstructured":"Guignard, M. (2007b). A new, solvable, primal relaxation for nonlinear integer programming problems with linear constraints. Optimization Online, http:\/\/www.optimization-online.org\/DB_HTML\/2007\/10\/1816.html , also Operations and Information Management Working Paper, University of Pennsylvania."},{"key":"969_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ro\/197004V300671","volume":"3","author":"P. L. Hammer","year":"1970","unstructured":"Hammer, P. L., & Rubin, A. A. (1970). Some remarks on quadratic programming with 0\u20131 variables. RAIRO, 3, 67\u201379.","journal-title":"RAIRO"},{"key":"969_CR17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121181","volume":"31","author":"D. W. Hearn","year":"1987","unstructured":"Hearn, D. W., Lawphongpanich, S., & Ventura, J. A. (1987). Restricted simplicial decomposition: computation and extensions. Mathematical Programming Studies, 31, 99\u2013118.","journal-title":"Mathematical Programming Studies"},{"key":"969_CR18","unstructured":"Michelon, P., & Maculan, N. (1992). Solving the Lagrangean dual problem in integer programming. Report #822, Departement d\u2019Informatique et de Recherche Operationnelle, University of Montreal."},{"key":"969_CR19","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2010.02.006","volume":"206","author":"A. A. Pessoa","year":"2010","unstructured":"Pessoa, A. A., Hahn, P. M., Guignard, M., & Zhu, Y.-R. (2010). Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. European Journal of Operational Research, 206, 54\u201363.","journal-title":"European Journal of Operational Research"},{"key":"969_CR20","unstructured":"Plateau, M. C. (2006). Reformulations quadratiques convexes pour la programmation quadratique en variables 0\u20131. Doctoral Dissertation, Laboratoire Cedric, CNAM, France."},{"key":"969_CR21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01584323","volume":"13","author":"B. Hohenbalken Von","year":"1977","unstructured":"Von Hohenbalken, B. (1977). Simplicial decomposition in nonlinear programming algorithms. Mathematical Programming, 13, 49\u201368.","journal-title":"Mathematical Programming"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0969-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0969-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0969-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:08Z","timestamp":1559138888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0969-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,30]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["969"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0969-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,30]]}}}