{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:52Z","timestamp":1740122752454,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10732-019-09433-w","type":"journal-article","created":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T19:02:55Z","timestamp":1578337375000},"page":"251-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0\u20131 problems"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4084-434X","authenticated-orcid":false,"given":"Monique","family":"Guignard","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7204-1424","authenticated-orcid":false,"given":"Aykut","family":"Ahlatcioglu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,6]]},"reference":[{"key":"9433_CR1","unstructured":"Ahlatcioglu, A., Guignard, M.: The convex hull relaxation for nonlinear integer programs with linear constraints. Technical report, University of Pennsylvania, The Wharton School, OPIM Department, Philadelphia, PA (2007\u20132009)"},{"key":"9433_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10479-011-0969-1","volume":"199","author":"A Ahlatcioglu","year":"2012","unstructured":"Ahlatcioglu, A., Bussieck, M., Esen, M., Guignard, M., Jagla, J.-H., Meeraus, A.: Combining QCR and CHR for convex quadratic pure 0\u20131 programming problems with linear constraints. Ann. Oper. Res. 199, 33\u201349 (2012)","journal-title":"Ann. Oper. Res."},{"key":"9433_CR3","unstructured":"Ahn, S.: On solving some optimization problems in stochastic and integer programming with applications in finance and banking. Ph.D. dissertation, University of Pennsylvania (1997)"},{"key":"9433_CR4","unstructured":"Albornoz, V.: Diseno de Modelos y Algoritmos de Optimizacion Robusta y su Aplicacion a la Planicacion Agregada de la Produccion. Ph.D. thesis, Universidad Catolica de Chile, Santiago, Chile (1998)"},{"key":"9433_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/10556780108805828","volume":"16","author":"KM Anstreicher","year":"2001","unstructured":"Anstreicher, K.M., Brixius, N.W.: Solving quadratic assignment problems using convex quadratic programming relaxations. Optim. Methods Softw. 16, 49\u201368 (2001)","journal-title":"Optim. Methods Softw."},{"key":"9433_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Pisinger, D., Toth, P.: Exact solution of the Quadratic Knapsack Problem. INFORMS J. Comput. 11, 125\u2013137 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9433_CR7","unstructured":"Cardoso da Silva, D.: Uma heuristica hibrida de busca em vizinhanca larga para o problema de atribuicao de portas de cross-dock. Universidade Federal Fluminense, Escola de Enghenaria, Mestrado em Engenharia de Producao (2013)"},{"key":"9433_CR8","unstructured":"Contesse, L., Guignard M.: 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 (1995, latest revision 2009)"},{"key":"9433_CR9","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1287\/ijoc.1040.0128","volume":"18","author":"J-F Cordeau","year":"2006","unstructured":"Cordeau, J.-F., Gaudioso, M., Laporte, G., Moccia, L.: A memetic heuristic for the generalized assignment problem. INFORMS J. Comput. 18, 433\u2013443 (2006)","journal-title":"INFORMS J. Comput."},{"key":"9433_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Q. 3, 95\u2013109 (1956)","journal-title":"Naval Res. Q."},{"key":"9433_CR11","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangean relaxation for integer programming. Math. Program. Stud. 2, 82\u2013114 (1974)","journal-title":"Math. Program. Stud."},{"key":"9433_CR12","unstructured":"Guignard, M.: Primal relaxations for integer programming. Invited plenary talk, VII CLAIO, Santiago, Chile (July 1994). Also Technical Report 94\u201302\u201301, University of Pennsylvania, OPIM Department (1994)"},{"issue":"2","key":"9433_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard, M.: Lagrangean relaxation. TOP 11(2), 151\u2013228 (2003)","journal-title":"TOP"},{"key":"9433_CR14","unstructured":"Guignard, M.: A new, solvable, primal relaxation for nonlinear integer programming problems with linear constraints. Optimization Online (2007). http:\/\/www.optimizationonline.org\/DB_FILE\/2011\/01\/2904.pdf"},{"key":"9433_CR15","unstructured":"Guignard, M., Hahn, P.M., Pessoa, A.A., Cardoso da Silva, D.: Algorithms for the cross-dock door assignment problem. In: Proceedings of the 4th International Workshop on Model-Based Metaheuristics. Angra dos Reis, Brazil, pp. 1\u201312 (2012)"},{"key":"9433_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0167-6377(85)90016-1","volume":"4","author":"DW Hearn","year":"1985","unstructured":"Hearn, D.W., Lawphongpanich, S., Ventura, J.A.: Finiteness in restricted simplicial decomposition. Oper. Res. Lett. 4, 125\u2013130 (1985)","journal-title":"Oper. Res. Lett."},{"key":"9433_CR17","unstructured":"Lee, C.-G., Ma, Z.: The generalized quadratic assignment problem. Research Report, Department of Mechanical and Industrial Engineering, University of Toronto (2003)"},{"key":"9433_CR18","unstructured":"L\u00e9tocart, L., Nagih A., Plateau G.: Reoptimization in Lagrangian methods for the 01 quadratic knapsack problem. Computers and O.R., Special Issue on Knapsack Problems and Applications, 39, 12\u201318 (2012)"},{"key":"9433_CR19","unstructured":"L\u00e9tocart, L., Plateau, G.: Private communication (2015\u20132016)"},{"key":"9433_CR20","unstructured":"Michelon, P., Maculan, N.: Solving the Lagrangean dual problem in integer programming. Report 822, Departement d\u2019 Informatique et de Recherche Operationnelle, University of Montreal (1992)"},{"key":"9433_CR21","volume-title":"Encyclopedia of Optimization","author":"M Patriksson","year":"2008","unstructured":"Patriksson, M.: Simplicial decomposition algorithms. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization. Springer, Boston (2008)"},{"key":"9433_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for best semidefinite relaxation for 0\u20131 quadratic programming. J. Glob. Optim. 7, 51\u201373 (1995)","journal-title":"J. Glob. Optim."},{"key":"9433_CR23","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1287\/opre.43.5.781","volume":"43","author":"MGC Resende","year":"1995","unstructured":"Resende, M.G.C., Ramakrishnan, K.G., Drezner, Z.: Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Oper. Res. 43, 781\u2013791 (1995)","journal-title":"Oper. Res."},{"key":"9433_CR24","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero\u2013one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"9433_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01584323","volume":"13","author":"B von Hohenbalken","year":"1977","unstructured":"von Hohenbalken, B.: Simplicial decomposition in nonlinear programming algorithms. Math. Program. 13, 49\u201368 (1977)","journal-title":"Math. Program."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09433-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09433-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09433-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T09:07:49Z","timestamp":1617440869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09433-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,6]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9433"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09433-w","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2020,1,6]]},"assertion":[{"value":"6 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}