{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:54:27Z","timestamp":1777694067116,"version":"3.51.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319961507","type":"print"},{"value":"9783319961514","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-96151-4_15","type":"book-chapter","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T16:21:49Z","timestamp":1531844509000},"page":"170-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Bounded Pitch Inequalities for the Min-Knapsack Polytope"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Faenza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Malinovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monaldo","family":"Mastrolilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bazzi, A., Fiorini, S., Huang, S., Svensson, O.: Small extended formulation for knapsack cover inequalities from monotone circuits. In: Proceedings of SODA 2017, pp. 2326\u20132341 (2017)","DOI":"10.1137\/1.9781611974782.153"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.orl.2007.09.003","volume":"36","author":"D Bienstock","year":"2008","unstructured":"Bienstock, D.: Approximate formulations for 0\u20131 knapsack sets. Oper. Res. Lett. 36(3), 317\u2013320 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10107-005-0598-z","volume":"105","author":"D Bienstock","year":"2006","unstructured":"Bienstock, D., Zuckerberg, M.: Approximate fixed-rank closures of covering problems. Math. Program. 105(1), 9\u201327 (2006)","journal-title":"Math. Program."},{"key":"15_CR4","unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of SODA 2000, pp. 106\u2013115 (2000)"},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0"},{"key":"15_CR6","unstructured":"Dudycz, S., Moldenhauer, C.: Approximated extended formulations for the knapsack cover problem. Technical report, EPFL (2015)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Faenza, Y., Malinovi\u0107, I., Mastrolilli, M., Svensson, O.: On bounded pitch inequalities for the min-knapsack polytope. arXiv preprint arXiv:1801.08850 (2018)","DOI":"10.1007\/978-3-319-96151-4_15"},{"key":"15_CR8","unstructured":"Ferreira, C.E.: On combinatorial optimization problems arising in computer system design. Ph.D. thesis, Technical University of Berlin, Germany (1994)"},{"key":"15_CR9","unstructured":"Fiorini, S., Huynh, T., Weltge, S.: Strengthening convex relaxations of 0\/1-sets using boolean formulas. arXiv preprint arXiv:1711.01358 (2017)"},{"key":"15_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, New York (1988). https:\/\/doi.org\/10.1007\/978-3-642-78240-4"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463\u2013468 (1975)","journal-title":"J. ACM"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1287\/moor.2016.0797","volume":"42","author":"A Kurpisz","year":"2017","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: On the hardest problem formulations for the 0\/1 lasserre hierarchy. Math. Oper. Res. 42(1), 135\u2013143 (2017)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"EL Lawler","year":"1979","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4), 339\u2013356 (1979)","journal-title":"Math. Oper. Res."},{"key":"15_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1988)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96151-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T20:20:13Z","timestamp":1693772413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96151-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961507","9783319961514"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96151-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/isco2018.lip6.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}