{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T22:14:35Z","timestamp":1768083275312,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T00:00:00Z","timestamp":1364256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s12532-013-0052-9","type":"journal-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T01:24:21Z","timestamp":1364174661000},"page":"171-200","source":"Crossref","is-referenced-by-count":20,"title":["Local cuts for mixed-integer programming"],"prefix":"10.1007","volume":"5","author":[{"given":"Va\u0161ek","family":"Chv\u00e1tal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Cook","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Espinoza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,26]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1, 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"52_CR2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33, 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"key":"52_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34, 1\u201312 (2006)","journal-title":"Oper. Res. Lett."},{"key":"52_CR4","first-page":"1","volume-title":"Experimental and Efficient Algorithms, Second International Workshop, WEA 2003","author":"E Althaus","year":"2003","unstructured":"Althaus, E., Polzin, T., Daneshmand, S.V.: Improving linear programming approaches for the Steiner tree problem. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds.) Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, pp. 1\u201314. Springer, Berlin (2003)"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Applegate, D., Bixby, R.E., Chv\u00e1tal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School], pp. 261\u2013304. Springer, London (2001)","DOI":"10.1007\/3-540-45586-8_7"},{"key":"52_CR6","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D Applegate","year":"2006","unstructured":"Applegate, D., Bixby, R.E., Chv\u00e1tal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"52_CR7","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.orl.2006.12.010","volume":"35","author":"D Applegate","year":"2007","unstructured":"Applegate, D., Cook, W., Dash, S., Espinoza, D.: Exact solutions to linear programming problems. Oper. Res. Lett. 35, 693\u2013699 (2007)","journal-title":"Oper. Res. Lett."},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52, 487\u2013490 (2004)","journal-title":"Oper. Res."},{"key":"52_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discr. Appl. Math. 89, 3\u201344 (1998)","journal-title":"Discr. Appl. Math."},{"key":"52_CR10","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":"52_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Natraj, N.: Gomory cuts revisited. Oper. Res. Lett. 19, 1\u20139 (1996)","journal-title":"Oper. Res. Lett."},{"key":"52_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E Balas","year":"2008","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure. Math. Program. 113, 219\u2013240 (2008)","journal-title":"Math. Program."},{"key":"52_CR13","first-page":"16","volume":"25","author":"RE Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: a test set of mixed integer programming problems. SIAM News 25, 16 (1992)","journal-title":"SIAM News"},{"key":"52_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/1.9780898718805.ch18","volume-title":"The Sharpest Cut: The Impact of Manfred Padberg and His Work","author":"RE Bixby","year":"2004","unstructured":"Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: Mixed-integer programming: a progress report. In: Gr\u00f6tschel, M. (ed.) The Sharpest Cut: The Impact of Manfred Padberg and His Work, pp. 309\u2013325. SIAM, Philadelphia (2004)"},{"key":"52_CR15","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1137\/0803038","volume":"3","author":"EA Boyd","year":"1993","unstructured":"Boyd, E.A.: Generating Fenchel cutting planes for knapsack polyhedra. SIAM J. Optim. 3, 734\u2013750 (1993)","journal-title":"SIAM J. Optim."},{"key":"52_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"EA Boyd","year":"1994","unstructured":"Boyd, E.A.: Fenchel cutting planes for integer programs. Oper. Res. 42, 53\u201364 (1994)","journal-title":"Oper. Res."},{"key":"52_CR17","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.orl.2008.01.004","volume":"36","author":"C Buchheim","year":"2008","unstructured":"Buchheim, C., Liers, F., Oswald, M.: Local cuts revisited. Oper. Res. Lett. 36, 430\u2013433 (2008)","journal-title":"Oper. Res. Lett."},{"key":"52_CR18","unstructured":"Buchheim, C., Liers, F., Oswald, M.: Speeding up IP-based algorithms for constrained quadratic 0\u20131 optimization. Tech. Rep. zaik2008-578, Zentrum f\u00fcr Angewandte Informatik K\u00f6ln, Germany (2008)"},{"key":"52_CR19","first-page":"221","volume":"74","author":"A Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: 0,1\/2-Chv\u00e1tal-Gomory cuts. Math. Program. 74, 221\u2013235 (1996)","journal-title":"Math. Program."},{"key":"52_CR20","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/ijoc.1090.0324","volume":"21","author":"W Cook","year":"2009","unstructured":"Cook, W., Dash, S., Fukasawa, R., Goycoolea, M.: Numerically safe gomory mixed-integer cuts. INFORMS J. Comput. 21, 641\u2013649 (2009)","journal-title":"INFORMS J. Comput."},{"key":"52_CR21","doi-asserted-by":"crossref","unstructured":"Cook, W., Koch, T., Steffy, D.E., Wolter, K.: An exact rational mixed-integer programming solver. In: Integer Programming and Combinatorial Optimization, 15th International IPCO Conference, IBM T. J. Watson Research Center, Yorktown Heights, New York, NY, USA, Lecture Notes in Computer Science, pp. 104\u2013116. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20807-2_9"},{"key":"52_CR22","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1287\/ijoc.15.4.385.24893","volume":"15","author":"G Cornu\u00e9jols","year":"2003","unstructured":"Cornu\u00e9jols, G., Li, Y., Vandenbussche, D.: K-cuts: a variation of Gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. 15, 385\u2013396 (2003)","journal-title":"INFORMS J. Comput."},{"key":"52_CR23","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"HP Crowder","year":"1983","unstructured":"Crowder, H.P., Johnson, E.L., Padberg, M.W.: Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"52_CR24","doi-asserted-by":"crossref","unstructured":"Espinoza, D., Fukasawa, R., Goycoolea, M.: Lifting, tilting and fractional programming revisited. Oper. Res. Lett. 559\u2013563 (2010)","DOI":"10.1016\/j.orl.2010.08.007"},{"key":"52_CR25","unstructured":"Espinoza, D.G.: On Linear Programming, Integer Programming and Cutting Planes, PhD thesis, School of Industrial and Systems Engineering. Georgia Institute of Technology (2006)"},{"key":"52_CR26","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Tech. Rep. RM-2597, RAND Corporation (1960)"},{"key":"52_CR27","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Berlin (1993)","DOI":"10.1007\/978-3-642-78240-4"},{"key":"52_CR28","first-page":"437","volume":"85","author":"Z Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted cover inequalities for 0\u20131 integer programs. Math. Program. 85, 437\u2013467 (1999)","journal-title":"Math. Program."},{"key":"52_CR29","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z Gu","year":"2000","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Sequence independent lifting in mixed integer programming. J. Combinator. Optim. 4, 109\u2013129 (2000)","journal-title":"J. Combinator. Optim."},{"key":"52_CR30","unstructured":"ILOG: User\u2019s Manual, ILOG CPLEX 10.0, ILOG CPLEX Division, Incline Village, Nevada (2006)"},{"issue":"2011","key":"52_CR31","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R., Danna, E., Gamrath, G., Gleixner, A., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2011), 103\u2013163 (2011). doi: 10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"key":"52_CR32","unstructured":"Lenstra H.W Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)"},{"key":"52_CR33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11, 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"key":"52_CR34","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2003","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363\u2013371 (2003)","journal-title":"Oper. Res."},{"key":"52_CR35","unstructured":"Mittelmann, H.: Mixed integer linear programming benchmark (free codes). http:\/\/plato.asu.edu\/ftp\/milpf.html (2008)"},{"key":"52_CR36","doi-asserted-by":"crossref","unstructured":"Perregaard, M., Balas, E.: Generating cuts from multiple-term disjunctions. In: IntegerProgramming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, pp. 348\u2013360. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45535-3_27"},{"key":"52_CR37","doi-asserted-by":"crossref","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 1\u201324 (2009). doi: 10.1007\/s10107-009-0335-0","DOI":"10.1007\/s10107-009-0335-0"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0052-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-013-0052-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0052-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T05:18:22Z","timestamp":1562822302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-013-0052-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,26]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["52"],"URL":"https:\/\/doi.org\/10.1007\/s12532-013-0052-9","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,26]]}}}