Branch-and-cut Algorithms for Integer Programming, Branch-and-cut

@inproceedings{1998BranchandcutAF,
  title={Branch-and-cut Algorithms for Integer Programming, Branch-and-cut},
  author={},
  year={1998}
}
  • Published 1998
Branch-and-cut methods are exact algorithms for integer programming problems. They consist of a combination of a cutting plane method with a branch-and-bound algorithm. These methods work by solving a sequence of linear programming relaxations of the integer programming problem. Cutting plane methods improve the relaxation of the problem to more closely approximate the integer programming problem, and branch-and-bound algorithms proceed by a sophisticated divide and conquer approach to solve… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 34 references

An Updated Mixed Integer Programming Library MIPLIB

Bixby Sebastian Ceria Cassandra
1998

Mixed 0–1 programming by lift-and-project in a date

E Balas, S Ceria, G Cornuéjols
Mixed 0–1 programming by lift-and-project in a date • 1998
View 1 Excerpt

file: mitche2 date: September 15

file: mitche2 date: September 15 • 1998

The design of the branch-and-cut system ABACUS

M Jünger, S Thienel
The design of the branch-and-cut system ABACUS • 1997
View 1 Excerpt

Similar Papers

Loading similar papers…