{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T02:40:11Z","timestamp":1683254411842},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T00:00:00Z","timestamp":1129075200000},"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":[[2006,2]]},"DOI":"10.1007\/s10107-005-0650-z","type":"journal-article","created":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T15:10:17Z","timestamp":1129129817000},"page":"215-232","source":"Crossref","is-referenced-by-count":3,"title":["Polyhedra related to integer-convex polynomial systems"],"prefix":"10.1007","volume":"105","author":[{"given":"Dennis","family":"Michaels","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,12]]},"reference":[{"key":"650_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"Al-Khayyal","year":"2","unstructured":"Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Mathematics of Operations Research 8 (2), 273\u2013286 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"650_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts - a new type of cutting planes for integer programming. Operations Research 19, 19\u201339 (1971)","journal-title":"Operations Research"},{"key":"650_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Mathematical Programming 58, 295\u2013324 (1993)","journal-title":"Mathematical Programming"},{"key":"650_CR4","doi-asserted-by":"crossref","unstructured":"Gangadwala, J., Kienle, A., Haus, U.U., Michaels, D., Weismantel, R.: Optimal process design for the synthesis of 2,3-dimethylbutene-1 (2005). Manuscript","DOI":"10.1016\/S1570-7946(05)80263-9"},{"key":"650_CR5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22, 180\u2013182 (1974)","journal-title":"Oper. Res."},{"key":"650_CR6","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex analysis and minimization algorithms. Part 1: Fundamentals. Grundlehren der Mathematischen Wissenschaften. 305. Berlin: Springer- Verlag. xvii, 417 p. DM 128.00; sfr 128.00 (1993)","DOI":"10.1007\/978-3-662-02796-7"},{"key":"650_CR7","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An explicit exact sdp relaxation for nonlinear 0\u20131 programs. In: K.e.a. Aardal (ed.) Integer programming and combinatorial optimization. 8th international IPCO conference, Utrecht, Netherlands, June 13\u201315, Lecture Notes Computer Science, vol. 2081, pp. 293\u2013303. Springer (2001)","DOI":"10.1007\/3-540-45535-3_23"},{"key":"650_CR8","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"Lasserre","year":"3","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 (3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"650_CR9","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1090\/S0002-9947-01-02898-7","volume":"354","author":"Lasserre","year":"2","unstructured":"Lasserre, J.B.: Polynomials nonnegative on a grid and discrete optimization. Trans. Am. Math. Soc. 354 (2), 631\u2013649 (2002)","journal-title":"Trans. Am. Math. Soc."},{"key":"650_CR10","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"Laurent","year":"3","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28 (3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"650_CR11","unstructured":"Laurent, M.: Semidefinite representations for finite varieties (December 2002 [updated on February 13, 2003]). To appear in Mathematical Programming. Preprint available from http:\/\/home\/pag\/es.cwi.nl\/~mo\/nique\/"},{"key":"650_CR12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"Lov\u00e1sz","year":"2","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1 (2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"650_CR13","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Squared functional systems and optimization problems. In: H.e.a. Frenk (ed.) High performance optimization, Appl. Optim., vol. 33, pp. 405\u2013440. Kluwer Academic Publishers, Dordrecht (2000)","DOI":"10.1007\/978-1-4757-3216-0_17"},{"key":"650_CR14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"Parrilo","year":"2","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B 96 (2), 293\u2013320 (2003)","journal-title":"Mathematical Programming Ser. B"},{"key":"650_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01446568","volume":"289","author":"Schm\u00fcdgen","year":"2","unstructured":"Schm\u00fcdgen, K.: The k-moment problem for compact semi-algebraic sets. Math. Ann. 289 (2), 203\u2013-206 (1991)","journal-title":"Math. Ann."},{"key":"650_CR16","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"Sherali","year":"3","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3 (3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"650_CR17","unstructured":"Shor, N.Z.: Quadratic optimization problems. Izv. Akad. Nauk SSSR Tekhn. Kibernet. (1), 128\u2013139, 222 (1987)"},{"key":"650_CR18","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"Watters","year":"1967","unstructured":"Watters, L.J.: Reduction of integer polynomial programmming problems to zero-one linear programming problems. Operations Research 15, 1171\u20131174 (1967)","journal-title":"Operations Research"},{"key":"650_CR19","unstructured":"Williams, H.: Model building in mathematical programming. A Wiley-Interscience Publication. Chichester etc.: John Wiley & Sons Ltd. xiv, 356 p. (1990). Reprinted September 1994"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0650-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0650-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0650-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T02:15:49Z","timestamp":1683252949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0650-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,12]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["650"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0650-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,12]]}}}