乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T09:06:51Z","timestamp":1723280811555},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T00:00:00Z","timestamp":1165881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10107-006-0080-6","type":"journal-article","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T20:07:18Z","timestamp":1165867638000},"page":"259-282","source":"Crossref","is-referenced-by-count":108,"title":["A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations"],"prefix":"10.1007","volume":"113","author":[{"given":"Samuel","family":"Burer","sequence":"first","affiliation":[]},{"given":"Dieter","family":"Vandenbussche","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,12]]},"reference":[{"key":"80_CR1","doi-asserted-by":"crossref","unstructured":"Absil, P.-A., Tits, A.: Newton-KKT interior-point methods for indefinite quadratic programming. Manuscript, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA (2006). To appear in Computational Optimization and Applications","DOI":"10.1007\/s10589-006-8717-1"},{"key":"80_CR2","unstructured":"Anstreicher, K.M.: Combining RLT and SDP for nonconvex QCQP. Talk given at the Workshop on Integer Programming and Continuous Optimization, Chemnitz University of Technology, November 7\u20139 (2004)"},{"key":"80_CR3","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24(2), 163\u2013185 (2002). Dedicated to Professor Naum Z. Shor on his 65th birthday","DOI":"10.1023\/A:1020209017701"},{"issue":"3","key":"80_CR4","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/040609574","volume":"16","author":"S. Burer","year":"2006","unstructured":"Burer S. and Vandenbussche D. (2006). Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16(3): 726\u2013750","journal-title":"SIAM J. Optim."},{"key":"80_CR5","doi-asserted-by":"crossref","unstructured":"Floudas, C., Visweswaran, V.: Quadratic optimization. In: Horst, R., Pardalos, P. (eds.) Handbook of Global Optimization, pp. 217\u2013269. Kluwer Academic Publishers (1995)","DOI":"10.1007\/978-1-4615-2025-2_5"},{"key":"80_CR6","doi-asserted-by":"crossref","unstructured":"Giannessi, F., Tomasin, E.: Nonconvex quadratic programs, linear complementarity problems, and integer linear programs. In: Fifth Conference on Optimization Techniques (Rome, 1973), Part I, pp. 437\u2013449. Lecture Notes in Computer Science, vol. 3. Springer, Berlin Heidelberg New York (1973)","DOI":"10.1007\/3-540-06583-0_43"},{"key":"80_CR7","unstructured":"Globallib: http:\/\/www.gamsworld.org\/global\/globallib.htm"},{"key":"80_CR8","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans M. and Williamson D. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42: 1115\u20131145","journal-title":"J. ACM"},{"key":"80_CR9","doi-asserted-by":"crossref","unstructured":"Gould, N.I.M., Toint, P.L.: Numerical methods for large-scale non-convex quadratic . In: Trends in Industrial and Applied Mathematics (Amritsar, 2001), vol. 72 of Appl. Optim., pp. 149\u2013179. Kluwer Academic Publishers, Dordrecht (2002)","DOI":"10.1007\/978-1-4613-0263-6_8"},{"issue":"3","key":"80_CR10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","volume":"40","author":"P. Hansen","year":"1993","unstructured":"Hansen P., Jaumard B., Ruiz M. and Xiong J. (1993). Global minimization of indefinite quadratic functions subject to box constraints. Naval Res. Logist. 40(3): 373\u2013392","journal-title":"Naval Res. Logist."},{"key":"80_CR11","unstructured":"ILOG, Inc.: ILOG CPLEX 9.0, User Manual (2003)."},{"issue":"3","key":"80_CR12","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/S1052623498336450","volume":"10","author":"M. Kojima","year":"2000","unstructured":"Kojima M. and Tun\u00e7el L. (2000). Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optim. 10(3): 750\u2013778","journal-title":"SIAM J. Optim."},{"issue":"3","key":"80_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1023\/A:1020300717650","volume":"24","author":"M. Kojima","year":"2002","unstructured":"Kojima M. and Tun\u00e7el L. (2002). Some fundamental properties of successive convex relaxation methods on LCP and related problems. J. Global Optim. 24(3): 333\u2013348","journal-title":"J. Global Optim."},{"issue":"5","key":"80_CR14","first-page":"1049","volume":"248","author":"M.K. Kozlov","year":"1979","unstructured":"Kozlov M.K., Tarasov S.P. and Khachiyan L.G. (1979). Polynomial solvability of convex quadratic programming. Dokl. Akad. Nauk SSSR 248(5): 1049\u20131051","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"80_CR15","first-page":"244","volume":"25","author":"F.A. Lootsma","year":"1970","unstructured":"Lootsma F.A. and Pearson J.D. (1970). An indefinite-quadratic-programming model for a continuous-production problem. Philips Res. Rep. 25: 244\u2013254","journal-title":"Philips Res. Rep."},{"key":"80_CR16","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L. and Schrijver A. (1991). Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1: 166\u2013190","journal-title":"SIAM J. Optim."},{"key":"80_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1080\/10556789808805690","volume":"9","author":"Y. Nesterov","year":"1998","unstructured":"Nesterov Y. (1998). Semidefinite relaxation and nonconvex quadratic optimization. Optim. Methods Softw. 9: 141\u2013160","journal-title":"Optim. Methods Softw."},{"key":"80_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0898-1221(91)90163-X","volume":"21","author":"P. Pardalos","year":"1991","unstructured":"Pardalos P. (1991). Global optimization algorithms for linearly constrained indefinite quadratic problems. Comput. Math. Appl. 21: 87\u201397","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"80_CR19","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos P.M. and Vavasis S.A. (1991). Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1(1): 15\u201322","journal-title":"J. Global Optim."},{"key":"80_CR20","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N.V. Sahinidis","year":"1996","unstructured":"Sahinidis N.V. (1996). BARON a general purpose global optimization software package. J. Glob. Optim. 8: 201\u2013205","journal-title":"J. Glob. Optim."},{"key":"80_CR21","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"H.D. Sherali","year":"2002","unstructured":"Sherali H.D. and Fraticelli B.M.P. (2002). Enhancing RLTrelaxations via a new class of semidefinite cuts. J. Global Optim. 22: 233\u2013261","journal-title":"J. Global Optim."},{"key":"80_CR22","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2(1), 101\u2013112 (1992) Conference on Computational Methods in Global Optimization, I (Princeton, NJ, 1991)."},{"key":"80_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H.D. Sherali","year":"1995","unstructured":"Sherali H.D. and Tuncbilek C.H. (1995). A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. 7: 1\u201331","journal-title":"J. Global Optim."},{"issue":"2","key":"80_CR24","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M. Skutella","year":"2001","unstructured":"Skutella M. (2001). Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2): 206\u2013242","journal-title":"J. ACM"},{"issue":"3","key":"80_CR25","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche D. and Nemhauser G. (2005). A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3): 531\u2013557","journal-title":"Math. Program."},{"issue":"3","key":"80_CR26","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche D. and Nemhauser G. (2005). A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3): 559\u2013575","journal-title":"Math. Program."},{"issue":"2, Ser. A","key":"80_CR27","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y. Ye","year":"1999","unstructured":"Ye Y. (1999). Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84(2, Ser. A): 219\u2013226","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0080-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0080-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0080-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:02Z","timestamp":1559123402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0080-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,12]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["80"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0080-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,12]]}}}