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 problems with structure, such as network design, is explored.

MoreLess

Year of publication:	1999
Authors:	Marchand, H. ; Martin, A. ; Weismantel, R. ; Wolsey, L.
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	ECONOMETRICS \| MATHEMATICAL ANALYSIS \| PROGRAMMING

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

More details

Series:	Papers.
Type of publication:	Book / Working Paper
Notes:	50 pages
Classification:	C10 - Econometric and Statistical Methods: General. General ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis
Source:	RePEc - Research Papers in Economics

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