{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:17:31Z","timestamp":1761394651149},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T00:00:00Z","timestamp":1433203200000},"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":["Math. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0917-y","type":"journal-article","created":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T14:27:53Z","timestamp":1433168873000},"page":"547-564","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Duality for mixed-integer convex minimization"],"prefix":"10.1007","volume":"158","author":[{"given":"Michel","family":"Baes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timm","family":"Oertel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,2]]},"reference":[{"issue":"1","key":"917_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1515\/advgeom.2011.028","volume":"12","author":"G Averkov","year":"2012","unstructured":"Averkov, G., Weismantel, R.: Transversal numbers over subsets of linear spaces. Adv. Geom. 12(1), 19\u201328 (2012)","journal-title":"Adv. Geom."},{"key":"917_CR2","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6, 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"917_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/B978-0-12-468650-2.50015-8","volume-title":"Nonlinear Programming 2","author":"E Balas","year":"1975","unstructured":"Balas, E.: Disjunctive programming: cutting planes from logical conditions. In: Mangasarian, O.L. (ed.) Nonlinear Programming 2, pp. 279\u2013312. Academic Press, New York (1975)"},{"key":"917_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01949705","volume":"3","author":"J-P Doignon","year":"1973","unstructured":"Doignon, J.-P.: Convexity in cristallographical lattices. J. Geom. 3, 71\u201385 (1973)","journal-title":"J. Geom."},{"key":"917_CR5","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"key":"917_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(78)90112-7","volume":"23","author":"RG Jeroslow","year":"1978","unstructured":"Jeroslow, R.G.: Cutting plane theory: algebraic methods. Discrete Math. 23, 121\u2013150 (1978)","journal-title":"Discrete Math."},{"key":"917_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0167-5060(08)70344-3","volume":"5","author":"RG Jeroslow","year":"1979","unstructured":"Jeroslow, R.G.: An introduction to the theory of cutting planes. Ann. Discrete Math. 5, 71\u201395 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"917_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01588222","volume":"17","author":"RG Jeroslow","year":"1979","unstructured":"Jeroslow, R.G.: Minimal inequalities. Math. Program. 17(1), 1\u201315 (1979)","journal-title":"Math. Program."},{"key":"917_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, E.L.: Cyclic groups, cutting planes and shortest paths. In: Hu, T.C., Robinson, S.M. (eds.) Math. Program., pp. 185\u2013211. Academic Press, New York (1973)","DOI":"10.1016\/B978-0-12-358350-5.50009-9"},{"key":"917_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, E.L.: On the group problem and a subadditive approach to integer programming. Ann. Discrete Math. 5, 97\u2013112 (1979)","DOI":"10.1016\/S0167-5060(08)70345-5"},{"key":"917_CR11","unstructured":"Karush, W.: Minima of functions of several variables with inequalities as side conditions. Dissertation, Department of Mathematics, University of Chicago (1939)"},{"key":"917_CR12","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, 1950, pp. 481\u2013492. University of California Press, Berkeley and Los Angeles (1951)","DOI":"10.1525\/9780520411586-036"},{"issue":"3","key":"917_CR13","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1137\/130908841","volume":"23","author":"JB Lasserre","year":"2013","unstructured":"Lasserre, J.B.: A Lagrangian relaxation view of linear and semidefinite hierarchies. SIAM J. Optim. 23(3), 1742\u20131756 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"917_CR14","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","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":"917_CR15","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. In: Mathematical Programming (Tokyo, 1988), vol. 6, Mathematics and its Applications (Japanese Series), pp. 177\u2013201. SCIPRESS, Tokyo (1989)"},{"key":"917_CR16","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L\u00e1szl\u00f3 Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L\u00e1szl\u00f3: Schrijver, A.: Cones of matrices and set-functions and 0\/1 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"917_CR17","doi-asserted-by":"crossref","unstructured":"Mor\u00e1n, D.A., Dey, S.S., Vielma, J.P.: A strong dual for conic mixed-integer programs. SIAM J. Optim. 22(3), 1136\u20131150 (2012)","DOI":"10.1137\/110840868"},{"key":"917_CR18","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete Convex Analysis","author":"K Murota","year":"2003","unstructured":"Murota, K.: Discrete Convex Analysis. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, SIAM Monographs on Discrete Mathematics and Applications (2003)"},{"key":"917_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"917_CR20","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Applied Optimization, vol. 87. Kluwer Academic Publishers, Boston (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"917_CR21","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","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, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"917_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Norwell (1999)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0917-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0917-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0917-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T08:58:22Z","timestamp":1717923502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0917-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,2]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["917"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0917-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,2]]}}}