Fixing Variables and Generating Classical Cutting Planes when using an Interior Point Branch and Cut Method to solve Integer Programming Problems

@inproceedings{Mitchell1997FixingVA,
  title={Fixing Variables and Generating Classical Cutting Planes when using an Interior Point Branch and Cut Method to solve Integer Programming Problems},
  author={John E. Mitchell},
  year={1997}
}
Branch and cut methods for integer programming problems solve a sequence of linear programming problems. Traditionally, these linear programming relaxations have been solved using the simplex method. The reduced costs available at the optimal solution to a relaxation may make it possible to fix variables at zero or one. If the solution to a relaxation is fractional, additional constraints can be generated which cut off the solution to the relaxation, but do not cut off any feasible integer… CONTINUE READING