Practical problem solving with cutting plane algorithms in combinatorialoptimization

@inproceedings{Jnger1993PracticalPS,
  title={Practical problem solving with cutting plane algorithms in combinatorialoptimization},
  author={Michael J{\"u}nger and Gerhard Reinelt and Stefan Thienel},
  booktitle={Combinatorial Optimization},
  year={1993}
}
Cutting plane algorithms have turned out to be practically successful computational tools in combinatorial optimization, in particular, when they are embedded in a branch and bound framework. Implementations of such \branch and cut" algorithms are rather complicated in comparison to many purely combinatorial algorithms. The purpose of this article is to give an introduction to cutting plane algorithms from an implementor's point of view. Special emphasis is given to control and data structures… CONTINUE READING
44 Citations
76 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

References

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

A complete description of the traveling salesman

  • unger, G. Reinelt
  • 1991
Highly Influential
7 Excerpts

Design of survivable networks, Lecture Notes in Mathematics 1531

  • M. Stoer
  • 1992
Highly Influential
4 Excerpts

A polyhedral approach to the rural postman

  • J.M.A. Corber an
  • Sanchis
  • 1991
Highly Influential
8 Excerpts

Large-scale zero-one linear programming on distributed workstations, Ph.D

  • T. L. Cannon
  • 1988
Highly Influential
7 Excerpts

Scheduling of vehicles from a central depot to a number of delivery

  • G. Clarke, J. W. Wright
  • 1964
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…