Fügenschuh AR, Martin A (2005)
Publication Language: English
Publication Type: Book chapter / Article in edited volumes
Publication year: 2005
Publisher: Kluwer
Edited Volumes: Handbooks in Operations Research and Management Science
Book Volume: 12
Pages Range: 69 -- 122
Conference Proceedings Title: Handbooks in Operations Research and Management Science
The study and solution of mixed-integer programming problems is of great interest, because they arise in a variety of mathematical and practical applications. Today's state-of-art software packages for solving mixed-integer programs based on linear programming include preprocessing, branch-and-bound, and cutting planes techniques. The main purpose of this article is to describe these components and recent developments that can be found in many solvers. Besides linear programming based relaxation methods we also discuss Langrangean, Dantzig-Wolfe and Benders' decomposition and their interrelations.
APA:
Fügenschuh, A.-R., & Martin, A. (2005). Computational Integer Programming and Cutting Planes. In K.~Aardal, G.~Nemhauser, R.~Weismantel (Eds.), Handbooks in Operations Research and Management Science. (pp. 69 -- 122). Kluwer.
MLA:
Fügenschuh, Armin-René, and Alexander Martin. "Computational Integer Programming and Cutting Planes." Handbooks in Operations Research and Management Science. Ed. K.~Aardal, G.~Nemhauser, R.~Weismantel, Kluwer, 2005. 69 -- 122.
BibTeX: Download