{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:37Z","timestamp":1742913337497,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457709"},{"type":"electronic","value":"9783030457716"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45771-6_28","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"364-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Lattice-Free Gradient Polyhedra in Dimension Two"],"prefix":"10.1007","author":[{"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":[[2020,4,14]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72792-7_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Andersen","year":"2007","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.) IPCO 2007. LNCS, vol. 4513, pp. 1\u201315. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-72792-7_1"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/moor.2016.0836","volume":"42","author":"G Averkov","year":"2017","unstructured":"Averkov, G., Kr\u00fcmpelmann, J., Weltge, S.: Notions of maximality for integral lattice-free polyhedra: the case of dimension three. Math. Oper. Res. 42(4), 1035\u20131062 (2017)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1287\/moor.1110.0510","volume":"36","author":"G Averkov","year":"2011","unstructured":"Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three. Math. Oper. Res. 36(4), 721\u2013742 (2011)","journal-title":"Math. Oper. Res."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-38189-8_5","volume-title":"Facets of Combinatorial Optimization","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 of Combinatorial Optimization, pp. 101\u2013131. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38189-8_5"},{"key":"28_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"},{"issue":"1","key":"28_CR6","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. Oper. Res. 19(1), 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"28_CR7","volume-title":"A Course in Convexity, Graduate Studies in Mathematics","author":"A Barvinok","year":"2002","unstructured":"Barvinok, A.: A Course in Convexity, Graduate Studies in Mathematics, vol. 54. American Mathematical Society, Providence (2002)"},{"key":"28_CR8","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. Oper. Res. Lett. 45, 671\u2013674 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"28_CR9","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. Oper. Res. 35(3), 704\u2013720 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"28_CR10","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). \nhttps:\/\/doi.org\/10.1007\/s10107-015-0890-5","journal-title":"Math. Program."},{"issue":"2","key":"28_CR11","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. Oper. Res. 37(2), 346\u2013355 (2012)","journal-title":"Math. Oper. Res."},{"key":"28_CR12","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."},{"issue":"2","key":"28_CR13","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., et al.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"28_CR14","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)"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10479-015-2024-0","volume":"240","author":"A Del Pia","year":"2015","unstructured":"Del Pia, A., Weismantel, R.: Relaxations of mixed integer sets from lattice-free polyhedra. Ann. Oper. Res. 240(1), 95\u2013117 (2015). \nhttps:\/\/doi.org\/10.1007\/s10479-015-2024-0","journal-title":"Ann. Oper. Res."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-68891-4_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"SS Dey","year":"2008","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.) IPCO 2008. LNCS, vol. 5035, pp. 463\u2013475. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68891-4_32"},{"key":"28_CR17","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."},{"issue":"3","key":"28_CR18","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":"28_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2, 1st edn. Springer, Heidelberg (1988). \nhttps:\/\/doi.org\/10.1007\/978-3-642-78240-4","edition":"1"},{"key":"28_CR20","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. Manag. Sci. 31, 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"key":"28_CR21","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."},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0035826","volume-title":"STACS 88","author":"CP Schnorr","year":"1988","unstructured":"Schnorr, C.P.: Geometry of numbers and integer programming. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 1\u20137. Springer, Heidelberg (1988). \nhttps:\/\/doi.org\/10.1007\/BFb0035826"},{"key":"28_CR23","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. Nat. Acad. Sci. U.S.A. 74, 3637\u20133641 (1977)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45771-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T23:12:20Z","timestamp":1589929940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}