Branch and Cut Algorithms

@inproceedings{Beasley1999BranchAC,
  title={Branch and Cut Algorithms},
  author={John E. Beasley},
  year={1999}
}
is the objective function to be optimized over P . Whenever all variables in (1.1) are restricted to be integral, the problem is known as a linear integer programming (IP) problem. Conversely, a pure linear programming (LP) problem results when all variables in (1.1) are restricted to be real valued. As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P , it may be advantageous to divide that region into a nite number of smaller regions and optimize the… CONTINUE READING

Similar Papers

Loading similar papers…