{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T19:21:51Z","timestamp":1774034511589,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"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":["Math. Program."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10107-015-0925-y","type":"journal-article","created":{"date-parts":[[2015,6,30]],"date-time":"2015-06-30T08:34:57Z","timestamp":1435653297000},"page":"329-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Approximating polyhedra with sparse inequalities"],"prefix":"10.1007","volume":"154","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianyi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,1]]},"reference":[{"key":"925_CR1","unstructured":"Achterberg, T.: Personal communication"},{"issue":"1\u20132","key":"925_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10107-012-0596-x","volume":"143","author":"E Amaldi","year":"2014","unstructured":"Amaldi, E., Coniglio, S., Gualandi, S.: Coordinated cutting plane generation via multi-objective separation. Math. Program. 143(1\u20132), 87\u2013110 (2014). doi: 10.1007\/s10107-012-0596-x","journal-title":"Math. Program."},{"key":"925_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, K., Weismantel, R.: Zero-coefficient cuts. In: Eisenbrand, F., Shepherd F.B. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 6080, pp. 57\u201370. Springer, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13036-6_5"},{"issue":"3","key":"925_CR4","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10107-005-0574-7","volume":"103","author":"E Balas","year":"2005","unstructured":"Balas, E., Souza, CCd: The vertex separator problem: a polyhedral investigation. Math. Program. 103(3), 583\u2013608 (2005). doi: 10.1007\/s10107-005-0574-7","journal-title":"Math. Program."},{"issue":"2","key":"925_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10107-009-0281-x","volume":"126","author":"A Basu","year":"2011","unstructured":"Basu, A., Bonami, P., Cornu\u00e9jols, G., Margot, F.: On the relative strength of split, triangle and quadrilateral cuts. Math. Program. 126(2), 281\u2013314 (2011)","journal-title":"Math. Program."},{"key":"925_CR6","doi-asserted-by":"crossref","unstructured":"Basu, A., Cornu\u00e9jols, G., Molinaro, M.: A probabilistic analysis of the strength of the split and triangle closures. In: G\u00fcnl\u00fck, O., Woeginger, G. (eds.) Integer Programming and Combinatoral Optimization. Lecture Notes in Computer Science, vol. 6655, pp. 27\u201338. Springer, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20807-2_3"},{"issue":"1","key":"925_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"RE Bixby","year":"2002","unstructured":"Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50(1), 3\u201315 (2002). doi: 10.1287\/opre.50.1.3.17780","journal-title":"Oper. Res."},{"key":"925_CR8","doi-asserted-by":"crossref","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)"},{"key":"925_CR9","doi-asserted-by":"crossref","unstructured":"Coleman, T.F.: Large Sparse Numerical Optimization. Springer, New York, NY (1984)","DOI":"10.1007\/3-540-12914-6"},{"key":"925_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9634-3","volume-title":"Probability for Statistics and Machine Learning","author":"A DasGupta","year":"2011","unstructured":"DasGupta, A.: Probability for Statistics and Machine Learning. Springer, Berlin (2011)"},{"key":"925_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","volume-title":"Order Statistics","author":"H David","year":"2003","unstructured":"David, H., Nagaraja, H.: Order Statistics. Wiley, New York (2003)"},{"key":"925_CR12","unstructured":"Dey, S.S., Iroume, A., Molinaro, M.: Some lower bounds on sparse outer approximations of polytopes. arXiv:1412.3765"},{"issue":"1","key":"925_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0613016","volume":"13","author":"S Eldersveld","year":"1992","unstructured":"Eldersveld, S., Saunders, M.: A block- $$lu$$ l u update for large-scale linear programming. SIAM J. Matrix Anal. Appl. 13(1), 191\u2013201 (1992). doi: 10.1137\/0613016","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"925_CR14","first-page":"335","volume":"69","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X.: Worst-case comparison of valid inequalities for the tsp. Math. Program. 69(2), 335\u2013349 (1995)","journal-title":"Math. Program."},{"key":"925_CR15","unstructured":"Gu, Z.: Personal communication"},{"key":"925_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0012-365X(75)90003-5","volume":"11","author":"R Jeroslow","year":"1975","unstructured":"Jeroslow, R.: On defining sets of vertices of the hypercube by linear inequalities. Discret. Math. 11, 119\u2013124 (1975)","journal-title":"Discret. Math."},{"issue":"1\u20132","key":"925_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K Kaparis","year":"2010","unstructured":"Kaparis, K., Letchford, A.N.: Separation algorithms for 0\u20131 knapsack polytopes. Math. Program. 124(1\u20132), 69\u201391 (2010)","journal-title":"Math. Program."},{"key":"925_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-22147-7","volume-title":"Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii, V.: Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems. Springer, Berlin (2011)"},{"key":"925_CR19","unstructured":"Matousek, J., Vondrak, J.: The Probabilistic Method (2008). Manuscript"},{"key":"925_CR20","unstructured":"Narisetty, A.: Personal communication"},{"issue":"1","key":"925_CR21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01585094","volume":"24","author":"J Reid","year":"1982","unstructured":"Reid, J.: A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases. Math. Program. 24(1), 55\u201369 (1982). doi: 10.1007\/BF01585094","journal-title":"Math. Program."},{"key":"925_CR22","doi-asserted-by":"crossref","unstructured":"Ziegler, G.M.: Lectures on 0\/1-polytopes. In: Polytopes Combinatorics and Computation, pp. 1\u201341. Springer, Berlin (2000)","DOI":"10.1007\/978-3-0348-8438-9_1"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0925-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0925-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0925-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:08Z","timestamp":1559109608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0925-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["925"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0925-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}