{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:54:37Z","timestamp":1743040477283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031598340"},{"type":"electronic","value":"9783031598357"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-59835-7_28","type":"book-chapter","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:05:03Z","timestamp":1716275103000},"page":"379-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds on\u00a0the\u00a0Complexity of\u00a0Mixed-Integer Programs for\u00a0Stable Set and\u00a0Knapsack"],"prefix":"10.1007","author":[{"given":"Jamico","family":"Schade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5702-2049","authenticated-orcid":false,"given":"Makrand","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0102-8326","authenticated-orcid":false,"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"issue":"1","key":"28_CR1","first-page":"147","volume":"44","author":"A Bazzi","year":"2019","unstructured":"Bazzi, A., Fiorini, S., Pokutta, S., Svensson, O.: No small linear program approximates vertex cover within a factor $$2-\\varepsilon $$. Math. Oper. Res. 44(1), 147\u2013172 (2019)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/moor.2014.0694","volume":"40","author":"G Braun","year":"2015","unstructured":"Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation limits of linear programs (beyond hierarchies). Math. Oper. Res. 40(3), 756\u2013772 (2015)","journal-title":"Math. Oper. Res."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Braun, G., Pokutta, S.: The matching polytope does not admit fully-polynomial size relaxation schemes. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 837\u2013846. SIAM (2014)","DOI":"10.1137\/1.9781611973730.57"},{"issue":"10","key":"28_CR4","doi-asserted-by":"publisher","first-page":"5754","DOI":"10.1109\/TIT.2015.2465864","volume":"61","author":"G Braun","year":"2015","unstructured":"Braun, G., Pokutta, S.: The matching problem has no fully polynomial size linear programming relaxation schemes. IEEE Trans. Inf. Theory 61(10), 5754\u20135764 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00453-016-0132-0","volume":"76","author":"G Braun","year":"2016","unstructured":"Braun, G., Pokutta, S.: Common information and unique disjointness. Algorithmica 76, 597\u2013629 (2016)","journal-title":"Algorithmica"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Braverman, M., Moitra, A.: An information complexity approach to extended formulations. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 161\u2013170 (2013)","DOI":"10.1145\/2488608.2488629"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Cevallos, A., Weltge, S., Zenklusen, R.: Lifting linear extension complexity bounds to the mixed-integer setting. arXiv:1712.02176 (2017)","DOI":"10.1137\/1.9781611975031.51"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Cevallos, A., Weltge, S., Zenklusen, R.: Lifting linear extension complexity bounds to the mixed-integer setting. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 788\u2013807. SIAM (2018)","DOI":"10.1137\/1.9781611975031.51"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-012-1269-0","volume":"204","author":"M Conforti","year":"2013","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Extended formulations in combinatorial optimization. Ann. Oper. Res. 204(1), 97\u2013143 (2013)","journal-title":"Ann. Oper. Res."},{"key":"28_CR10","volume-title":"Elements of Information Theory","author":"TM Cover","year":"1999","unstructured":"Cover, T.M.: Elements of Information Theory. Wiley, Hoboken (1999)"},{"issue":"125\u2013130","key":"28_CR11","first-page":"55","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Natl. Bureau Standards B 69(125\u2013130), 55\u201356 (1965)","journal-title":"J. Res. Natl. Bureau Standards B"},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2716307","volume":"62","author":"S Fiorini","year":"2015","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., De Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM (JACM) 62(2), 1\u201323 (2015)","journal-title":"J. ACM (JACM)"},{"issue":"6","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1137\/S0097539700366103","volume":"30","author":"AM Frieze","year":"2001","unstructured":"Frieze, A.M.: Edge-disjoint paths in expander graphs. SIAM J. Comput. 30(6), 1790\u20131801 (2001)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1017\/S0963548300004284","volume":"9","author":"AM Frieze","year":"2000","unstructured":"Frieze, A.M., Zhao, L.: Optimal construction of edge-disjoint paths in random regular graphs. Comb. Probab. Comput. 9(3), 241\u2013263 (2000)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/16M109884X","volume":"47","author":"M G\u00f6\u00f6s","year":"2018","unstructured":"G\u00f6\u00f6s, M., Jain, R., Watson, T.: Extension complexity of independent set polytopes. SIAM J. Comput. 47(1), 241\u2013269 (2018)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"28_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ipl.2012.02.009","volume":"112","author":"P Hrubes","year":"2012","unstructured":"Hrubes, P.: On the nonnegative rank of distance matrices. Inf. Process. Lett. 112(11), 457\u2013461 (2012). https:\/\/doi.org\/10.1016\/j.ipl.2012.02.009","journal-title":"Inf. Process. Lett."},{"key":"28_CR17","doi-asserted-by":"publisher","unstructured":"Huynh, T., Nordstr\u00f6m, J.: On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity. In: Karloff, H.J., Pitassi, T. (eds.) Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, 19\u201322 May 2012, pp. 233\u2013248. ACM (2012). https:\/\/doi.org\/10.1145\/2213977.2214000","DOI":"10.1145\/2213977.2214000"},{"key":"28_CR18","first-page":"2","volume":"85","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V.: Extended formulations in combinatorial optimization. Optima 85, 2\u20137 (2011)","journal-title":"Optima"},{"key":"28_CR19","unstructured":"Nordstr\u00f6m, J.: New wine into old wineskins: a survey of some pebbling classics with supplemental results (2009)"},{"key":"28_CR20","doi-asserted-by":"publisher","unstructured":"Rao, A., Yehudayoff, A.: Communication Complexity: and Applications. Cambridge University Press (2020). https:\/\/doi.org\/10.1017\/9781108671644","DOI":"10.1017\/9781108671644"},{"issue":"6","key":"28_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3127497","volume":"64","author":"T Rothvo\u00df","year":"2017","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. J. ACM (JACM) 64(6), 1\u201319 (2017)","journal-title":"J. ACM (JACM)"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Schade, J., Sinha, M., Weltge, S.: Lower bounds on the complexity of mixed-integer programs for stable set and knapsack. arXiv:2308.16711v2 (2024)","DOI":"10.1007\/978-3-031-59835-7_28"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Sinha, M.: Lower bounds for approximating the matching polytope. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1585\u20131604. SIAM (2018)","DOI":"10.1137\/1.9781611975031.104"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 223\u2013228 (1988)","DOI":"10.1145\/62212.62232"}],"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-031-59835-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T14:31:32Z","timestamp":1732026692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59835-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031598340","9783031598357"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59835-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","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":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco2024.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}