You can manage bookmarks using lists, please log in to your user account for this.
Media type:
Text;
E-Book
Title:
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
Contributor:
Jünger, Michael
[Author];
Reinelt, Gerhard
[Author];
Thienel, Stefan
[Author]
Published:
American Math. Soc, 1995
Language:
German;
English
Origination:
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
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 used in practically successful implementations of branch-and-cut algorithms. We also address the issue of parallelization. Finally, we point out that in important applications branch-and-cut algorithms are not only able to produce optimal solutions but also approximations to the optimum with certified good quality in moderate computation times. We close with an overview of successful practical applications in the literature.