Cutting planes in integer and mixed integer programming

DIAL.pr - BOREAL

Primary tabs

Authors	:	Marchand, Hugues Wolsey, Laurence [UCL] Martin, Alexander Weismantel, Robert
Document type	:	Document de travail (Working Paper)
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.
Access type	:	Accès libre
Publication date	:	1999
Collection	:	CORE Discussion Papers - 1999/53
Affiliation	:	UCL - CORE - Center for Operations Research and Econometrics
Keywords	:	Mixed Integer Programming ; Cutting Planes
Links	:	http://www.core.ucl.ac.be/services/psfiles/dp99/dp9953.pdf [Handle]http://hdl.handle.net/2078.1/4065

Bibliographic reference	Marchand, Hugues ; Wolsey, Laurence ; Martin, Alexander ; Weismantel, Robert. Cutting planes in integer and mixed integer programming. CORE Discussion Papers ; 1999/53 (1999)
Permanent URL	http://hdl.handle.net/2078.1/4065