General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

Article in Edited Volumes
(Book chapter)


Publication Details

Author(s): Martin A
Editor(s): D. Naddef, M. Jünger
Title edited volumes: Computational Combinatorial Optimization
Publisher: Springer, Berlin
Publication year: 2001
Language: English


Abstract


In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on preprocessing techniques, branch-and-bound issues and cutting plane generation.



FAU Authors / FAU Editors

Martin, Alexander Prof. Dr.
Economics - Discrete Optimization - Mathematics (EDOM)


How to cite

APA:
Martin, A. (2001). General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. In D. Naddef, M. Jünger (Eds.), Computational Combinatorial Optimization Springer, Berlin.

MLA:
Martin, Alexander. "General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms." Computational Combinatorial Optimization Ed. D. Naddef, M. Jünger, Springer, Berlin, 2001.

BibTeX: 

Last updated on 2018-10-08 at 05:26