Home Publications Research Grants Inventions & Patents Awards Additional Research Activities Faculties & Institutions Research Areas

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

Martin A (2001)

---

Publication Language: English

Publication Type: Book chapter / Article in edited volumes

Publication year: 2001

Publisher: Springer, Berlin

Edited Volumes: Computational Combinatorial Optimization

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.

Authors with CRIS profile

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: Download