{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:22:21Z","timestamp":1742926941287,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449524"},{"type":"electronic","value":"9783319449531"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_21","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"316-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems"],"prefix":"10.1007","author":[{"given":"Wen-Yang","family":"Ku","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"21_CR1","unstructured":"van Emde-Boas, P.: Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Mathematisch Instituut, Amsterdam, The Netherlands (1981)"},{"issue":"8","key":"21_CR2","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TIT.2002.800499","volume":"48","author":"E Agrell","year":"2002","unstructured":"Agrell, E., Eriksson, T., Vardy, A., Zeger, K.: Closest point search in lattices. IEEE Trans. Inf. Theory 48(8), 2201\u20132214 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1137\/060660680","volume":"31","author":"XW Chang","year":"2009","unstructured":"Chang, X.W., Golub, G.H.: Solving ellipsoid-constrained integer least squares problems. SIAM J. Matrix Anal. Appl. 31(3), 1071\u20131089 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"21_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-72011-6","volume-title":"GPS for Geodesy","author":"PJ Teunissen","year":"1998","unstructured":"Teunissen, P.J., Kleusberg, A., Teunissen, P.: GPS for Geodesy, vol. 2. Springer, Berlin (1998)"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/trsc.2013.0509","volume":"49","author":"JM Kuusinen","year":"2014","unstructured":"Kuusinen, J.M., Sorsa, J., Siikonen, M.L.: The elevator trip origin-destination matrix estimation problem. Transp. Sci. 49(3), 559\u2013576 (2014)","journal-title":"Transp. Sci."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11564751_35","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G Pesant","year":"2005","unstructured":"Pesant, G., R\u00e9gin, J.-C.: SPREAD: a balancing constraint based on statistics. In: Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 460\u2013474. Springer, Heidelberg (2005)"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/s10601-009-9076-1","volume":"15","author":"F Domes","year":"2010","unstructured":"Domes, F., Neumaier, A.: Constraint propagation on quadratic constraints. Constraints 15(3), 404\u2013429 (2010)","journal-title":"Constraints"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10601-004-5307-7","volume":"10","author":"Y Lebbah","year":"2005","unstructured":"Lebbah, Y., Michel, C., Rueher, M.: A rigorous global filtering algorithm for quadratic constraints. Constraints 10(1), 47\u201365 (2005)","journal-title":"Constraints"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-07046-9_24","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"W-Y Ku","year":"2014","unstructured":"Ku, W.-Y., Beck, J.C.: Combining discrete ellipsoid-based search and branch-and-cut for binary quadratic programming problems. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 334\u2013350. Springer, Heidelberg (2014)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TWC.2008.060497","volume":"7","author":"XW Chang","year":"2008","unstructured":"Chang, X.W., Han, Q.: Solving box-constrained integer least squares problems. IEEE Trans. Wirel. Commun. 7(1), 277\u2013287 (2008)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Ku, W.Y., Beck, J.C.: Combining discrete ellipsoid-based search and branch-and-cut for integer least squares problems. Submitted to IEEE Trans. Wirel. Commun. (2014)","DOI":"10.1007\/978-3-319-07046-9_24"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-3-319-18008-3_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"W-Y Ku","year":"2015","unstructured":"Ku, W.-Y., Beck, J.C.: Combining constraint propagation and discrete ellipsoid-based search to solve the exact quadratic knapsack problem. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 231\u2013239. Springer, Heidelberg (2015)"},{"key":"21_CR13","volume-title":"Matrix Computations","author":"GH Golub","year":"2012","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, vol. 3. JHU Press, Baltimore (2012)"},{"key":"21_CR14","unstructured":"Sahinidis, N.V.: BARON 14.3.1: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2014)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: Algorithms for coNTinuous\/Integer Global Optimization of Nonlinear Equations. J. Global Optim. (2014). doi:\n                      10.1007\/s10898-014-0166-2","DOI":"10.1007\/s10898-014-0166-2"},{"key":"21_CR17","volume-title":"MINLP Solver Software. Wiley Encyclopedia of Operations Research and Management Science","author":"MR Bussieck","year":"2010","unstructured":"Bussieck, M.R., Vigerske, S.: MINLP Solver Software. Wiley Encyclopedia of Operations Research and Management Science. Wiley, Chichester (2010)"},{"issue":"1","key":"21_CR18","first-page":"61","volume":"143","author":"N Krislock","year":"2012","unstructured":"Krislock, N., Malick, J., Roupin, F.: Improved semidefinite bounding procedure for solving max-cut problems to optimality. Math. Program. 143(1), 61\u201386 (2012)","journal-title":"Math. Program."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Krislock, N., Malick, J., Roupin, F.: BiqCrunch solver. \n                      http:\/\/lipn.univ-paris13.fr\/BiqCrunch\/download\n                      \n                    . Accessed 4 Dec 2016","DOI":"10.1145\/3005345"},{"key":"21_CR20","unstructured":"Borno, M.A.: Reduction in solving some integer least squares problems. arXiv preprint \n                      arXiv:1101.0382\n                      \n                     (2011)"},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"21_CR22","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"21_CR23","unstructured":"Gleixner, A.M.: Exact and fast algorithms for mixed-integer nonlinear programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2015)"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A., Ye, Y.: Interior-point Polynomial Algorithms in Convex Programming, vol. 13. SIAM, Philadelphia (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"21_CR25","unstructured":"Bonami, P., Tramontani, A.: Advances in CPLEX for mixed integer nonlinear optimization. Presented at ISMp 2015, Pittsburgh, PA (2015)"},{"issue":"2","key":"21_CR26","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.orl.2004.04.014","volume":"33","author":"M Lewis","year":"2005","unstructured":"Lewis, M., Alidaee, B., Kochenberger, G.: Using xqx to model and solve the uncapacitated task allocation problem. Oper. Res. Lett. 33(2), 176\u2013182 (2005)","journal-title":"Oper. Res. Lett."},{"key":"21_CR27","first-page":"61","volume":"132","author":"G FlNKE","year":"2011","unstructured":"FlNKE, G., Burkard, R.E., Rendl, F.: Quadratic assignment problems. Surv. Comb. Optim. 132, 61\u201382 (2011)","journal-title":"Surv. Comb. Optim."},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"MW Carter","year":"1984","unstructured":"Carter, M.W.: The indefinite zero-one quadratic problem. Discrete Appl. Math. 7(1), 23\u201344 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"21_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1590\/S0101-74382014000100005","volume":"34","author":"L L\u00e9tocart","year":"2014","unstructured":"L\u00e9tocart, L., Plateau, M.C., Plateau, G.: An efficient hybrid heuristic method for the 0\u20131 exact k-item quadratic knapsack problem. Pesquisa Operacional 34(1), 49\u201372 (2014)","journal-title":"Pesquisa Operacional"},{"issue":"1","key":"21_CR30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R Mart\u00ed","year":"2010","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A.: A branch and bound algorithm for the maximum diversity problem. Eur. J. Oper. Res. 200(1), 36\u201344 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"21_CR31","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(2), 125\u2013137 (1999)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"21_CR32","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2), 333\u2013345 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.renene.2013.10.023","volume":"63","author":"S Turner","year":"2014","unstructured":"Turner, S., Romero, D., Zhang, P., Amon, C., Chan, T.: A new mathematical programming approach to optimize wind farm layouts. Renewable Energy 63, 674\u2013680 (2014)","journal-title":"Renewable Energy"},{"issue":"3","key":"21_CR34","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s13675-014-0024-5","volume":"2","author":"PY Zhang","year":"2014","unstructured":"Zhang, P.Y., Romero, D.A., Beck, J.C., Amon, C.H.: Solving wind farm layout optimization with mixed integer programs and constraint programs. EURO J. Comput. Optim. 2(3), 195\u2013219 (2014)","journal-title":"EURO J. Comput. Optim."},{"issue":"10","key":"21_CR35","doi-asserted-by":"publisher","first-page":"2389","DOI":"10.1109\/TIT.2003.817444","volume":"49","author":"MO Damen","year":"2003","unstructured":"Damen, M.O., El Gamal, H., Caire, G.: On maximum-likelihood detection and the search for the closest lattice point. IEEE Trans. Inf. Theory 49(10), 2389\u20132402 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"21_CR36","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.cie.2004.01.011","volume":"46","author":"J Schaller","year":"2004","unstructured":"Schaller, J.: Single machine scheduling with early and quadratic tardy penalties. Comput. Ind. Eng. 46(3), 511\u2013532 (2004)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"21_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:55:20Z","timestamp":1558313720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"23 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}