Cutting Planes in Integer and Mixed Integer Programming

Martin A (2002)

Publication Language: English

Publication Type: Journal article

Publication year: 2002

Journal

Discrete Applied Mathematics Elsevier

Book Volume: 123/124

Pages Range: 391 -- 440

DOI: 10.1016/S0166-218X(01)00348-1

Abstract

This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Valid inequalities for (i) general integer programs, (ii) problems with local structure such as knapsack constraints, and (iii) problems with 0-1 coefficient matrices, such as set packing, are examined in turn. Finally, the use of valid inequalities for classes of problems with structure, such as network design, is explored.

Authors with CRIS profile

Alexander Martin Economics - Discrete Optimization - Mathematics (EDOM)

How to cite

APA:

Martin, A. (2002). Cutting Planes in Integer and Mixed Integer Programming. Discrete Applied Mathematics, 123/124, 391 -- 440. https://dx.doi.org/10.1016/S0166-218X(01)00348-1

MLA:

Martin, Alexander. "Cutting Planes in Integer and Mixed Integer Programming." Discrete Applied Mathematics 123/124 (2002): 391 -- 440.

BibTeX: Download