{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:18:38Z","timestamp":1705018718748},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,12,31]],"date-time":"2010-12-31T00:00:00Z","timestamp":1293753600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10107-010-0435-x","type":"journal-article","created":{"date-parts":[[2010,12,30]],"date-time":"2010-12-30T05:14:05Z","timestamp":1293686045000},"page":"337-363","source":"Crossref","is-referenced-by-count":5,"title":["Tightening simple mixed-integer sets with guaranteed bounds"],"prefix":"10.1007","volume":"133","author":[{"given":"Daniel","family":"Bienstock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"McClosky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,31]]},"reference":[{"key":"435_CR1","first-page":"279","volume-title":"Nonlinear Programming, vol. 2","author":"E. Balas","year":"1975","unstructured":"Balas E. et\u00a0al.: Disjunctive programs: cutting planes from logical conditions. In: Mangasarian, O.L. (ed.) Nonlinear Programming, vol. 2, pp. 279\u2013312. Academic Press, New York (1975)"},{"key":"435_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"435_CR3","doi-asserted-by":"crossref","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, 317\u2013320 (2008)","journal-title":"Oper. Res. Lett."},{"key":"435_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.disopt.2004.03.002","volume":"1","author":"D. Bienstock","year":"2004","unstructured":"Bienstock D., N.: Tree-width and the Sherali-Adams operator. Discrete Optim. 1, 13\u201322 (2004)","journal-title":"Discrete Optim."},{"key":"435_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1052623402420346","volume":"15","author":"D. Bienstock","year":"2004","unstructured":"Bienstock D., Zuckerberg M.: Subset\u00a0algebra lift operators for 0\u20131 Integer Programming. SIAM J. Optim. 15, 63\u201395 (2004)","journal-title":"SIAM J. Optim."},{"key":"435_CR6","doi-asserted-by":"crossref","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, 9\u201327 (2006)","journal-title":"Math. Program."},{"key":"435_CR7","unstructured":"Carnes, T., Shmoys, D.: Primal-dual schema for capacitated covering problems. In: Proceedings of the IPCO (2008)"},{"key":"435_CR8","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 the SODA (2000)"},{"key":"435_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.26.1.19.10593","volume":"26","author":"W. Cook","year":"2001","unstructured":"Cook W., Dash S.: On the matrix-cut rank of polyhedra. Math. Oper. Res. 26, 19\u201330 (2001)","journal-title":"Math. Oper. Res."},{"key":"435_CR10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0377-2217(84)90053-5","volume":"15","author":"A.M. Frieze","year":"1984","unstructured":"Frieze A.M., Clarke M.R.B.: Approximation algorithms for the m-dimensional knapsack problem: worst-case and probabilistic analyses. Eur. J. Oper. Res. 15, 100\u2013109 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"435_CR11","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1287\/moor.26.4.796.10012","volume":"26","author":"M.X. Goemans","year":"2001","unstructured":"Goemans M.X., Tun\u00e7el L.: When does the positive semidefiniteness constraint help in lifting procedures. Math. Oper. Res. 26, 796\u2013815 (2001)","journal-title":"Math. Oper. Res."},{"key":"435_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-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, Berlin (1988)"},{"key":"435_CR13","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Gu Z., Nemhauser G., Savelsbergh M.: Lifted flow cover inequalities for mixed 0\/1 integer programs. Math. Program. 85, 439\u2013467 (1999)","journal-title":"Math. Program."},{"key":"435_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1011493126498","volume":"5","author":"A.N. Letchford","year":"2001","unstructured":"Letchford A.N.: On disjunctive cuts for combinatorial optimization. J. Comb. Optim. 5, 299\u2013315 (2001)","journal-title":"J. Comb. Optim."},{"key":"435_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"435_CR16","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M. Padberg","year":"1985","unstructured":"Padberg M., Van Roy T., Wolsey L.: Valid linear inequalities for fixed charge problems. Oper. Res. 33, 842\u2013861 (1985)","journal-title":"Oper. Res."},{"key":"435_CR17","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"S. Sherali","year":"1990","unstructured":"Sherali S., Adams W.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"435_CR18","unstructured":"Van Vyve, M.: Polynomial relaxation schemes for knapsack, manuscript, February (2005)"},{"key":"435_CR19","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10107-005-0663-7","volume":"105","author":"M. Van Vyve","year":"2006","unstructured":"Van Vyve M., Wolsey L.A.: Approximate extended formulations. Math. Program. 105, 501\u2013522 (2006)","journal-title":"Math. Program."},{"key":"435_CR20","unstructured":"Zuckerberg, M.: A Set Theoretic Approach to Lifting Procedures for 0, 1 Integer Programming Ph.D dissertation, Columbia University (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0435-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0435-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0435-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:09Z","timestamp":1559109009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0435-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,31]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["435"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0435-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,31]]}}}