{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:52:56Z","timestamp":1742971976271,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070452"},{"type":"electronic","value":"9783319070469"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07046-9_24","type":"book-chapter","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T02:07:28Z","timestamp":1399860448000},"page":"334-350","source":"Crossref","is-referenced-by-count":3,"title":["Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems"],"prefix":"10.1007","author":[{"given":"Wen-Yang","family":"Ku","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","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. Operations research letters\u00a033(2), 176\u2013182 (2005)","journal-title":"Operations research letters"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Finke, G., Burkard, R., Rendl, F.: Quadratic assignment problems. Surveys in combinatorial optimization\u00a061 (2011)","DOI":"10.1016\/S0304-0208(08)73232-8"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Krislock, N., Malick, J., Roupin, F.: Improved semidefinite bounding procedure for solving max-cut problems to optimality. Mathematical Programming, 1\u201326 (2012)","DOI":"10.1007\/s10107-012-0594-z"},{"issue":"6","key":"24_CR4","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L.J. Watters","year":"1967","unstructured":"Watters, L.J.: Reduction of integer polynomial programming problems to zero-one linear programming problems. Operations Research\u00a015(6), 1171\u20131174 (1967)","journal-title":"Operations Research"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TWC.2008.060497","volume":"7","author":"X.W. Chang","year":"2008","unstructured":"Chang, X.W., Han, Q.: Solving box-constrained integer least squares problems. IEEE Transactions on Wireless Communications\u00a07(1), 277\u2013287 (2008)","journal-title":"IEEE Transactions on Wireless Communications"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1137\/060660680","volume":"31","author":"X.W. Chang","year":"2009","unstructured":"Chang, X.W., Golub, G.H.: Solving ellipsoid-constrained integer least squares problems. SIAM Journal on Matrix Analysis and Applications\u00a031(3), 1071\u20131089 (2009)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"8","key":"24_CR7","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/S0305-0548(97)00002-6","volume":"24","author":"B. Borchers","year":"1997","unstructured":"Borchers, B., Mitchell, J.E.: A computational comparison of branch and bound and outer approximation algorithms for 0\u20131 mixed integer nonlinear programs. Computers & Operations Research\u00a024(8), 699\u2013701 (1997)","journal-title":"Computers & Operations Research"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. In: Mixed-Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol.\u00a0154, pp. 427\u2013445. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_15"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F. Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Mathematical Programming\u00a0121(2), 307\u2013335 (2010)","journal-title":"Mathematical Programming"},{"key":"24_CR10","unstructured":"Wiegele, A.: Biq mac library\u2013a collection of max-cut and quadratic 0\u20131 programming instances of medium size. Preprint (2007)"},{"issue":"4","key":"24_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s10898-011-9713-2","volume":"52","author":"D. Li","year":"2012","unstructured":"Li, D., Sun, X., Liu, C.: An exact solution method for unconstrained quadratic 0\u20131 programming: a geometric approach. Journal of Global Optimization\u00a052(4), 797\u2013829 (2012)","journal-title":"Journal of Global Optimization"},{"key":"24_CR12","series-title":"Wiley Encyclopedia of Operations Research and Management Science","volume-title":"MINLP solver software","author":"M.R. 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":"24_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A. Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Mathematical Programming\u00a0109(1), 55\u201368 (2007)","journal-title":"Mathematical Programming"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Teunissen, P.J., Kleusberg, A., Teunissen, P.: GPS for Geodesy, vol.\u00a02. Springer (1998)","DOI":"10.1007\/978-3-642-72011-6"},{"key":"24_CR15","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"24_CR16","unstructured":"Ku, W.Y., Beck, J.C.: Combining discrete ellipsoid-based search and branch-and-cut for integer least squares problems. Technical Report MIE-OR-TR2013-07, University of Toronto, Toronto (2013)"},{"issue":"1","key":"24_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C.P. Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Mathematical programming\u00a066(1), 181\u2013199 (1994)","journal-title":"Mathematical programming"},{"issue":"12","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O.K. Gupta","year":"1985","unstructured":"Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Management Science\u00a031(12), 1533\u20131546 (1985)","journal-title":"Management Science"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M.A. Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical programming\u00a036(3), 307\u2013339 (1986)","journal-title":"Mathematical programming"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T. Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex minlp problems. Computers & Chemical Engineering\u00a019, 131\u2013136 (1995)","journal-title":"Computers & Chemical Engineering"},{"issue":"4","key":"24_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. Journal of Optimization Theory and Applications\u00a010(4), 237\u2013260 (1972)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"4","key":"24_CR22","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1287\/ijoc.1090.0373","volume":"22","author":"K. Abhishek","year":"2010","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.: Filmint: An outer approximation-based solver for convex mixed-integer nonlinear programs. INFORMS Journal on computing\u00a022(4), 555\u2013567 (2010)","journal-title":"INFORMS Journal on computing"},{"key":"24_CR23","unstructured":"Ku, W.Y., Anjos, M.F., Chang, X.W.: Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems. Technical report, Group for Research in Decision Analysis, Montreal (2013)"},{"key":"24_CR24","unstructured":"Krislock, N., Malick, J., Roupin, F.: BiqCrunch online solver (2012), \n                    http:\/\/lipn.univ-paris13.fr\/BiqCrunch\/solver\n                   (retrieved: December 22, 2013)"},{"issue":"1","key":"24_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"M.W. Carter","year":"1984","unstructured":"Carter, M.W.: The indefinite zero-one quadratic problem. Discrete Applied Mathematics\u00a07(1), 23\u201344 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR26","unstructured":"Williams, A.: Quadratic 0-1 Programming Using the Roof Dual: With Computational Results. RUTCOR, Hill Center, Rutgers University (1985)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07046-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:17:07Z","timestamp":1609204627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07046-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070452","9783319070469"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07046-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}