TY - JOUR A1 - Chvátal, Vašek A1 - Cook, William A1 - Espinoza, Daniel T1 - Local cuts for mixed-integer programming T2 - Mathematical Programming Computation N2 - A general framework for cutting-plane generation was proposed by Applegate et al. in the context of the traveling salesman problem. The process considers the image of a problem space under a linear mapping, chosen so that a relaxation of the mapped problem can be solved efficiently. Optimization in the mapped space can be used to find a separating hyperplane, if one exists, and via substitution this gives a cutting plane in the original space.We extend this procedure to general mixed-integer programming problems, obtaining a range of possibilities for new sources of cutting planes. Some of these possibilities are explored computationally, both in floating-point arithmetic and in rational arithmetic. KW - Software KW - Theoretical Computer Science Y1 - 2013 UR - https://opus4.kobv.de/opus4-mpc/frontdoor/index/index/docId/55 SN - 1867-2949 VL - 5 IS - 2 SP - 171 EP - 200 PB - Springer Science and Business Media LLC ER -