Highly Influenced

# 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} }

- Published 1993 in Combinatorial Optimization

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

#### From This Paper

##### Figures, tables, and topics from this paper.

44 Citations

76 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-10 of 76 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential