{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T02:15:37Z","timestamp":1772936137721,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,7]],"date-time":"2015-01-07T00:00:00Z","timestamp":1420588800000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10898-014-0263-2","type":"journal-article","created":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T05:12:15Z","timestamp":1420521135000},"page":"661-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A polynomial case of convex integer quadratic programming problems with box integer constraints"],"prefix":"10.1007","volume":"62","author":[{"given":"Chunli","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,7]]},"reference":[{"key":"263_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s101070100233","volume":"91","author":"K Allemand","year":"2001","unstructured":"Allemand, K., Fukuda, K., Liebling, T.M., Steiner, E.: A polynomial case of unconstrained zero\u2013one quadratic optimization. Math. Program. 91, 49\u201352 (2001)","journal-title":"Math. Program."},{"key":"263_CR2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10732-005-3603-z","volume":"11","author":"H Alperin","year":"2005","unstructured":"Alperin, H., Nowak, I.: Lagrangian smothing heuristics for max-cut. J. Heuristics 11, 447\u2013463 (2005)","journal-title":"J. Heuristics"},{"key":"263_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65, 21\u201346 (1996)","journal-title":"Discret. Appl. Math."},{"key":"263_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","volume":"13","author":"F Barahona","year":"1986","unstructured":"Barahona, F.: A solvable case of quadratic 01 programming. Discret. Appl. Math. 13, 23\u201326 (1986)","journal-title":"Discret. Appl. Math."},{"key":"263_CR5","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"D Bertsimas","year":"1998","unstructured":"Bertsimas, D., Ye, Y.: Semidefinite relaxations, multivariate normal distributions, and order statistics. In: Du, D.Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 1\u20137. Kluwer, Dordrecht (1998)"},{"key":"263_CR6","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.disopt.2007.02.001","volume":"5","author":"E Borosa","year":"2008","unstructured":"Borosa, E., Hammera, P.L., Sunb, R., Tavares, G.: A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO). Discret. Optim. 5, 501\u2013529 (2008)","journal-title":"Discret. Optim."},{"key":"263_CR7","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-011-0475-x","volume":"135","author":"C Buchheim","year":"2012","unstructured":"Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135, 369\u2013395 (2012)","journal-title":"Math. Program."},{"key":"263_CR8","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1137\/120878495","volume":"23","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., De Santis, M., Palagi, L., et al.: An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations. SIAM J. Optim. 23, 1867\u20131889 (2013)","journal-title":"SIAM J. Optim."},{"key":"263_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(92)90256-A","volume":"36","author":"ST Chakradhar","year":"1992","unstructured":"Chakradhar, S.T., Bushnell, M.L.: A solvable class of quadratic 0\u20131 programming. Discret. Appl. Math. 36, 233\u2013251 (1992)","journal-title":"Discret. Appl. Math."},{"key":"263_CR10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/moor.19.1.94","volume":"19","author":"S Cosares","year":"1994","unstructured":"Cosares, S., Hochbaum, D.S.: Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources. Math. Oper. Res. 19, 94\u2013111 (1994)","journal-title":"Math. Oper. Res."},{"key":"263_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0898-1221(91)90164-Y","volume":"21","author":"SS Erenguc","year":"1991","unstructured":"Erenguc, S.S., Benson, H.P.: An algorithm for indefinite integer quadratic programming. Comput. Math. Appl. 21, 99\u2013106 (1991)","journal-title":"Comput. Math. Appl."},{"key":"263_CR12","volume-title":"Computer and Intractability, a Guide to the Thoery of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability, a Guide to the Thoery of NP-Completeness. W. H. Freeman Co, San Francisco (1979)"},{"key":"263_CR13","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1007\/s10898-012-9853-z","volume":"56","author":"JJ Gao","year":"2013","unstructured":"Gao, J.J., Li, D.: A polynomial case of the cardinality-constrained quadratic optimization problem. J. Glob. Optim 56, 1441\u20131455 (2013)","journal-title":"J. Glob. Optim"},{"key":"263_CR14","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms formaximum cut ans satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"263_CR15","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10898-007-9155-z","volume":"39","author":"GD Halikias","year":"2007","unstructured":"Halikias, G.D., Jaimoukha, I.M., Malik, U., Gungah, S.K.: New bounds on the unconstrained quadratic integer programming problem. J. Glob. Optim. 39, 543\u2013554 (2007)","journal-title":"J. Glob. Optim."},{"key":"263_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"PL Hammer","year":"1984","unstructured":"Hammer, P.L., Hansen, P., Simeone, B.: Roof duality, complementation and persistency in quadratic 0\u20131 optimization. Math. Program. 28, 121\u2013155 (1984)","journal-title":"Math. Program."},{"key":"263_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01581207","volume":"55","author":"DS Hochbaum","year":"1992","unstructured":"Hochbaum, D.S., Shamir, R., Shanthikumar, J.G.: A polynomial algorithm for an ineger quadratic non-separable transportation problem. Math. Program. 55, 359\u2013371 (1992)","journal-title":"Math. Program."},{"key":"263_CR18","volume-title":"Nonlinear Integer Programming","author":"D Li","year":"2006","unstructured":"Li, D., Sun, X.L.: Nonlinear Integer Programming. Springer, New York (2006)"},{"key":"263_CR19","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1007\/s10898-011-9713-2","volume":"52","author":"D Li","year":"2012","unstructured":"Li, D., Sun, X.L., Liu, C.L.: An exact solution method for uncoxnstrained quadratic 0\u20131 programming: a geometric approach. J. Glob. Optim. 52, 797\u2013829 (2012)","journal-title":"J. Glob. Optim."},{"key":"263_CR20","doi-asserted-by":"crossref","unstructured":"Li, D., Sun, X.L., Gu, S.S., Gao, J.J., Liu, C.L.: Polynomially solvable cases of binary quadratic programs. In: Pardalos, P.M., Enkhbat, R., Tseveendorj, I. (eds.) Optimization and Optimal Control: Theory and Applications, pp. 199\u2013225 (2010)","DOI":"10.1007\/978-0-387-89496-6_11"},{"key":"263_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Rodgers, G.P.: Computational aspects of branch and bound algorithm for quadratic zeroone programming. Computing 45, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"263_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(95)00245-6","volume":"95","author":"G Renu","year":"1996","unstructured":"Renu, G., Bandopadhyaya, L., Puri, M.C.: Ranking in quadratic integer programming problems. Eur. J. Oper. Res. 95, 231\u2013236 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"263_CR23","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","volume":"17","author":"J Rhys","year":"1970","unstructured":"Rhys, J.: A selection problem of shared fixed costs and network flows. Manag. Sci. 17, 200\u2013207 (1970)","journal-title":"Manag. Sci."},{"key":"263_CR24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10898-011-9683-4","volume":"53","author":"XL Sun","year":"2012","unstructured":"Sun, X.L., Liu, C.L., Li, D., Gao, J.J.: On duality gap in binary quadratic optimization. J. Glob. Optim. 53, 255\u2013269 (2012)","journal-title":"J. Glob. Optim."},{"key":"263_CR25","first-page":"137","volume":"6","author":"N Sleumer","year":"1999","unstructured":"Sleumer, N.: Output-sensitive cell enumeration in hyperplane arrangements. Nordic J. Comput. 6, 137\u2013161 (1999)","journal-title":"Nordic J. Comput."},{"key":"263_CR26","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0377-2217(94)90215-1","volume":"74","author":"V Vassilev","year":"1994","unstructured":"Vassilev, V., Genova, K.: An approximate algorithm for nonlinear integer programming. Eur. J. Oper. Res. 74, 170\u2013178 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"263_CR27","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10898-011-9650-0","volume":"51","author":"ZY Wu","year":"2011","unstructured":"Wu, Z.Y., Li, G.Q., Quan, J.: Global optimality conditions and optimization methods for quadratic integer programming problems. J. Glob. Optim. 51, 549\u2013568 (2011)","journal-title":"J. Glob. Optim."},{"key":"263_CR28","doi-asserted-by":"crossref","unstructured":"Zaslavsky, T.: Facing up to arrangements: Face-count formulas for partitions of space by hyperplanes, vol. 1. Memoirs of the American Mathematical Society. http:\/\/www.ams.org\/books\/memo\/0154\/ (1975)","DOI":"10.1090\/memo\/0154"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0263-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0263-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0263-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T04:21:14Z","timestamp":1566188474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0263-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,7]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["263"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0263-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,7]]}}}