Cutting planes in integer and mixed integer programming

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.

MoreLess

Year of publication:	1999-10-01
Authors:	MARCHAND, Hugues ; MARTIN, Alexander ; WEISMANTEL, Robert ; WOLSEY, Laurence
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	Mixed Integer Programming \| Cutting Planes

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	CORE Discussion Papers.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series UNIVERSITE CATHOLIQUE DE LOUVAIN, Center for Operations Research and Econometrics (CORE) Number 1999053
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005043126