@article{Chv{\´a}talCookEspinoza2013,
  author    = {Chv{\´a}tal, Vašek and Cook, William and Espinoza, Daniel},
  title     = {Local cuts for mixed-integer programming},
  journal   = {Mathematical Programming Computation},
  volume    = {5},
  number    = {2},
  publisher = {Springer Science and Business Media LLC},
  issn      = {1867-2949},
  doi       = {10.1007/s12532-013-0052-9},
  pages     = {171 -- 200},
  year      = {2013},
  abstract  = {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.},
  language  = {en}
}