{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T18:23:27Z","timestamp":1776363807640,"version":"3.51.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1023\/a:1020351410169","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T13:44:30Z","timestamp":1047735870000},"page":"311-332","source":"Crossref","is-referenced-by-count":11,"title":["Generating Convex Polynomial Inequalities for Mixed 0\u20131 Programs"],"prefix":"10.1007","volume":"24","author":[{"given":"Robert A.","family":"Stubbs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"390016_CR1","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas E. (1985), Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Alg. Disc. Math., 6(3): 466\u2013486.","journal-title":"IAM J. Alg. Disc. Math."},{"issue":"3","key":"390016_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S. and Cornu\u00e9jols, G. (1993), A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Mathematical Programming, 58(3): 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"390016_CR3","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas E., Ceria S., and Cornu\u00e9jols, G. (1996), Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Management Science, 42: 1229\u20131246.","journal-title":"Management Science"},{"key":"390016_CR4","doi-asserted-by":"crossref","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G. and Pataki, G. (1994), Polyhedral methods for the maximum clique problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science.","DOI":"10.21236\/ADA298925"},{"key":"390016_CR5","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S Bazaraa","year":"1993","unstructured":"Bazaraa M.S, Sherali H.D. and C.M. Shetty (1993), Nonlinear Programming: Theory and Algorithms, 2nd edition, John Wiley & Sons, New York.","edition":"2nd edition"},{"key":"390016_CR6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"4","author":"T. Fujie","year":"1997","unstructured":"Fujie T. and Kojima M. (1997), Semidefinite programming relaxation for nonconvex quadratic programs. Journal of Global Optimization, 4: 367\u2013380.","journal-title":"Journal of Global Optimization"},{"issue":"6","key":"390016_CR7","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(6): 1115\u20131145.","journal-title":"J ACM"},{"key":"390016_CR8","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1983","unstructured":"Golub, G.H. and Van Loan, C.F. (1983), Matrix Computations, (1st Edition). The Johns Hopkins University Press, Baltimore, MD.","edition":"1st Edition"},{"issue":"2","key":"390016_CR9","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"D. Karger","year":"1998","unstructured":"Karger D., Motwani R. and Sudan M. (1998), Approximate graph coloring by semidefinite programming. J ACM, 45(2): 246\u2013265.","journal-title":"J ACM"},{"issue":"2","key":"390016_CR10","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 Journal on Optimization, 1(2): 166\u2013190.","journal-title":"SIAM Journal on Optimization"},{"key":"390016_CR11","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0805024","volume":"5","author":"S. Poljak","year":"1995","unstructured":"Poljak S. and Rendl, F. (1995), Nonpolyhedral relaxations of graph bisection problems. SIAM Journal on Optimization, 5: 467\u2013487.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"390016_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D. and Adams, W.P. (1990), A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics, 3(3): 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"390016_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"H.D. Sherali","year":"1994","unstructured":"Sherali, H.D. and Adams, W.P. (1994), A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Applied Mathematics, 52: 83\u2013106.","journal-title":"Discrete Applied Mathematics"},{"key":"390016_CR14","volume-title":"Introduction to Numerical Analysis","author":"J. Stoer","year":"1983","unstructured":"Stoer, J. and Bulirsch, R. (1983), Introduction to Numerical Analysis. Springer, Berlin."},{"key":"390016_CR15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R.A. Stubbs","year":"1999","unstructured":"Stubbs, R.A. and Mehrotra, S. (1999), A branch-and-cut method for 0\u20131 mixed convex programming. Mathematical Programming, Series A, 86: 515\u2013532.","journal-title":"Mathematical Programming, Series A"},{"issue":"1","key":"390016_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe, L. and Boyd, S. (1996), Semidefinite programming. Siam Review, 38(1): 49\u201395.","journal-title":"Siam Review"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020351410169.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020351410169\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020351410169.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:47:23Z","timestamp":1751366843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020351410169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["390016"],"URL":"https:\/\/doi.org\/10.1023\/a:1020351410169","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}