{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:34:06Z","timestamp":1742956446136,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030738785"},{"type":"electronic","value":"9783030738792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73879-2_26","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"368-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computational Aspects of Relaxation Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2245-9958","authenticated-orcid":false,"given":"Gennadiy","family":"Averkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5324-8996","authenticated-orcid":false,"given":"Christopher","family":"Hojny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5156-7953","authenticated-orcid":false,"given":"Matthias","family":"Schymura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Averkov, G., Schymura, M.: Complexity of linear relaxations in integer programming. Mathematical Programming (2021). https:\/\/doi.org\/10.1007\/s10107-021-01623-4, (online first)","DOI":"10.1007\/s10107-021-01623-4"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/s00454-011-9376-2","volume":"47","author":"W Castryck","year":"2012","unstructured":"Castryck, W.: Moving out the edges of a lattice polygon. Discrete Comput. Geom. 47(3), 496\u2013518 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.4064\/aa-2-1-145-146","volume":"2","author":"JG van der Corput","year":"1936","unstructured":"van der Corput, J.G.: Verallgemeinerung einer Mordellschen Beweismethode in der Geometrie der Zahlen II. Acta Arith. 2, 145\u2013146 (1936)","journal-title":"Acta Arith."},{"key":"26_CR4","doi-asserted-by":"publisher","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Monographs in Theoretical Computer Science, vol. 10. Springer-Verlag, Berlin Heidelberg (1987). https:\/\/doi.org\/10.1007\/978-3-642-61568-9","DOI":"10.1007\/978-3-642-61568-9"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0890-5401(88)90049-1","volume":"77","author":"H Edelsbrunner","year":"1988","unstructured":"Edelsbrunner, H., Preparata, F.P.: Minimum polygonal separation. Inform. Comput. 77, 218\u2013232 (1988)","journal-title":"Inform. Comput."},{"key":"26_CR6","unstructured":"Gamrath, G., et al.: The SCIP Optimization Suite 7.0. Technical report, Optimization Online, March 2020. http:\/\/www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Hammer, P.L., Ibaraki, T., Peled, U.N.: Threshold numbers and threshold completions. In: Studies on Graphs and Discrete Programming (Brussels, 1979), Annals of Discrete Mathematics, vol. 11, pp. 125\u2013145. North-Holland, Amsterdam-New York (1981)","DOI":"10.1016\/S0304-0208(08)73462-5"},{"issue":"5","key":"26_CR8","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.orl.2020.07.013","volume":"48","author":"C Hojny","year":"2020","unstructured":"Hojny, C.: Polynomial size IP formulations of knapsack may require exponentially large coefficients. Oper. Res. Lett. 48(5), 612\u2013618 (2020)","journal-title":"Oper. Res. Lett."},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Hojny, C.: Strong IP formulations need large coefficients. Discrete Optim. 39, 100624 (2021). https:\/\/doi.org\/10.1016\/j.disopt.2021.100624","DOI":"10.1016\/j.disopt.2021.100624"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(75)90003-5","volume":"11","author":"RG Jeroslow","year":"1975","unstructured":"Jeroslow, R.G.: On defining sets of vertices of the hypercube by linear inequalities. Discrete Math. 11, 119\u2013124 (1975)","journal-title":"Discrete Math."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Weltge, S.: Lower bounds on the sizes of integer programs without additional variables. Math. Program. 154(1\u20132, Ser. B), 407\u2013425 (2015)","DOI":"10.1007\/s10107-014-0855-0"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(84)90033-4","volume":"18","author":"C Lee","year":"1984","unstructured":"Lee, C., Lee, D.: On a circle-cover minimization problem. Inf. Process. Lett. 18(2), 109\u2013115 (1984)","journal-title":"Inf. Process. Lett."},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-42432-3_37","volume-title":"Mathematical Software \u2013 ICMS 2016","author":"S Maher","year":"2016","unstructured":"Maher, S., Miltenberger, M., Pedroso, J.P., Rehfeldt, D., Schwarz, R., Serrano, F.: PySCIPOpt: mathematical programming in Python with the SCIP optimization suite. In: Greuel, G.-M., Koch, T., Paule, P., Sommese, A. (eds.) ICMS 2016. LNCS, vol. 9725, pp. 301\u2013307. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42432-3_37"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02187916","volume":"3","author":"N Megiddo","year":"1988","unstructured":"Megiddo, N.: On the complexity of polyhedral separability. Discrete Comput. Geom. 3, 325\u2013337 (1988)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.orl.2013.03.010","volume":"41","author":"S Pokutta","year":"2013","unstructured":"Pokutta, S., Van Vyve, M.: A note on the extension complexity of the knapsack polytope. Oper. Res. Lett. 41(4), 347\u2013350 (2013)","journal-title":"Oper. Res. Lett."},{"key":"26_CR16","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics, A Wiley-Interscience Publication, John Wiley & Sons Ltd, Chichester (1986)"},{"key":"26_CR17","volume-title":"Simple Games: Desirability Relations, Trading, Pseudoweightings","author":"AD Taylor","year":"1999","unstructured":"Taylor, A.D., Zwicker, W.S.: Simple Games: Desirability Relations, Trading, Pseudoweightings. Princeton University Press, Princeton (1999)"},{"key":"26_CR18","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.1) (2020). https:\/\/www.sagemath.org"},{"key":"26_CR19","unstructured":"Weltge, S.: Sizes of Linear Descriptions in Combinatorial Optimization. Ph.D. thesis, Otto-von-Guericke-Universit\u00e4t Magdeburg (2015). http:\/\/dx.doi.org\/10.25673\/4350"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73879-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:08:27Z","timestamp":1620169707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 May 2021","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":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.gatech.edu\/ipco-2021\/","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":"90","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":"37% - 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":"15","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference took place virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}