{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:49Z","timestamp":1740109309807,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T00:00:00Z","timestamp":1621036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T00:00:00Z","timestamp":1621036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10107-021-01658-7","type":"journal-article","created":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T15:02:31Z","timestamp":1621090951000},"page":"293-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Constructing lattice-free gradient polyhedra in dimension two"],"prefix":"10.1007","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2930-3155","authenticated-orcid":false,"given":"Joseph","family":"Paat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Schl\u00f6ter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emily","family":"Speakman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,15]]},"reference":[{"key":"1658_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"1658_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/sapm1977562187","volume":"56","author":"D Bell","year":"1977","unstructured":"Bell, D.: A theorem concerning the integer lattice. Stud. Appl. Math. 56, 187\u2013188 (1977)","journal-title":"Stud. Appl. Math."},{"key":"1658_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01949705","volume":"3","author":"J Doignon","year":"1973","unstructured":"Doignon, J.: Convexity in cristallographical lattices. J. Geom. 3, 71\u201385 (1973)","journal-title":"J. Geom."},{"key":"1658_CR4","doi-asserted-by":"publisher","first-page":"3637","DOI":"10.1073\/pnas.74.9.3637","volume":"74","author":"H Scarf","year":"1977","unstructured":"Scarf, H.: An observation on the structure of production sets with indivisibilities. Proc. Natl. Acad. Sci. U.S.A. 74, 3637\u20133641 (1977)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"1658_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s10107-015-0917-y","volume":"158","author":"M Baes","year":"2016","unstructured":"Baes, M., Oertel, T., Weismantel, R.: Duality for mixed-integer convex minimization. Math. Program. Ser. A 158, 547\u2013564 (2016)","journal-title":"Math. Program. Ser. A"},{"key":"1658_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.orl.2017.10.002","volume":"45","author":"A Basu","year":"2017","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Weismantel, R., Weltge, S.: Optimality certificates for convex minimization and Helly numbers. Op. Res. Let. 45, 671\u2013674 (2017)","journal-title":"Op. Res. Let."},{"key":"1658_CR7","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In Fischetti M., Williamson D.P., eds.: Integer Programming and Combinatorial Optimization (IPCO). Volume 4513 of Lecture Notes in Computer Science., Springer, Berlin, Heidelberg (2007)"},{"issue":"1","key":"1658_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts - a new type of cutting planes for integer programming. Op. Res. 19(1), 19\u201339 (1971)","journal-title":"Op. Res."},{"issue":"1","key":"1658_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10107-015-0890-5","volume":"151","author":"A Basu","year":"2015","unstructured":"Basu, A., Conforti, M., Di Summa, M.: A geometric approach to cut-generating functions. Math. Program. 151(1), 153\u2013189 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"1658_CR10","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/moor.1110.0536","volume":"37","author":"A Basu","year":"2012","unstructured":"Basu, A., Cornu\u00e9jols, G., K\u00f6ppe, M.: Unique minimal liftings for simplicial polytopes. Math. Op. Res. 37(2), 346\u2013355 (2012)","journal-title":"Math. Op. Res."},{"issue":"3","key":"1658_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10288-012-0198-8","volume":"10","author":"A Del Pia","year":"2012","unstructured":"Del Pia, A., Weismantel, R.: Relaxations of mixed integer sets from lattice-free polyhedra. 4OR 10(3), 221\u2013244 (2012)","journal-title":"4OR"},{"key":"1658_CR12","doi-asserted-by":"crossref","unstructured":"Averkov, G., Kr\u00fcmpelmann, J., Weltge, S.: Notions of maximality for integral lattice-free polyhedra: the case of dimension three. Mathematics of Operations Research 1035\u20131062 (2017)","DOI":"10.1287\/moor.2016.0836"},{"key":"1658_CR13","doi-asserted-by":"crossref","unstructured":"Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: Finiteness and an explicit description in dimension three. Math. Oper. Res. 721\u2013742 (2011)","DOI":"10.1287\/moor.1110.0510"},{"issue":"3","key":"1658_CR14","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1287\/moor.1100.0461","volume":"35","author":"A Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Maximal lattice-free convex sets in linear subspaces. Math. Op. Res. 35(3), 704\u2013720 (2010)","journal-title":"Math. Op. Res."},{"key":"1658_CR15","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In Lodi A., Panconesi A., Rinaldi G., eds.: International Conference on Integer Programming and Combinatorial Optimization (IPCO). Volume 5035 of Lecture Notes in Computer Science., Springer, Berlin, Heidelberg (2008) 463 \u2013 475","DOI":"10.1007\/978-3-540-68891-4_32"},{"key":"1658_CR16","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. In M.Iri, Tanabe, K., eds.: Mathematical Programming: Recent Developments and Applications, Kluwer Academic Publishers (1989) 177 \u2013 201"},{"key":"1658_CR17","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O Gupta","year":"1985","unstructured":"Gupta, O., Ravindran, V.: Branch and bound experiments in convex nonlinear integer programming. Manage. Sci. 31, 1533\u20131546 (1985)","journal-title":"Manage. Sci."},{"key":"1658_CR18","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S Leyffer","year":"2001","unstructured":"Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295\u2013309 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1658_CR19","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossman, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Opt. 5(2), 186\u2013204 (2008)","journal-title":"Discret. Opt."},{"issue":"3","key":"1658_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossman, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36(3), 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"1658_CR21","doi-asserted-by":"crossref","unstructured":"Dadush, D., Peikert, C., Vempala, S.: Enumerative lattice algorithms in any norm via M-ellipsoid coverings. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. (2011) 580\u2013589","DOI":"10.1109\/FOCS.2011.31"},{"key":"1658_CR22","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. 1 edn. Volume\u00a02 of Algorithms and Combinatorics. Springer-Verlag Berlin Heidelberg (1988)","DOI":"10.1007\/978-3-642-97881-4_1"},{"key":"1658_CR23","first-page":"101","volume-title":"Facets Comb. Op.","author":"M Baes","year":"2013","unstructured":"Baes, M., Oertel, T., Wagner, C., Weismantel, R.: Mirror-descent methods in mixed-integer convex optimization. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets Comb. Op., pp. 101\u2013131. Springer, Berlin, Heidelberg (2013)"},{"key":"1658_CR24","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A Course in Convexity. Volume\u00a054. Graduate Studies in Mathematics, American Mathematical Society, Providence, Rhode Island (2002)","DOI":"10.1090\/gsm\/054"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01658-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01658-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01658-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T17:18:34Z","timestamp":1646846314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01658-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,15]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1658"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01658-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2021,5,15]]},"assertion":[{"value":"29 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}