Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2011) Corner polyhedron and intersection cuts. Surveys in Operations Research and Management Science, 16 (2). pp. 105-120. ISSN 1876-7354
Full text not available from this repository.
Identification Number: 10.1016/j.sorms.2011.03.001
Abstract
Four decades ago, Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. A recent paper of Andersen, Louveaux, Weismantel and Wolsey has generated a renewed interest in the corner polyhedron and intersection cuts. We survey these two approaches and the recent developments in multi-row cuts. We stress the importance of maximal lattice-free convex sets and of the so-called infinite relaxation.
Item Type: | Article |
---|---|
Official URL: | http://www.elsevier.com/wps/find/journaldescriptio... |
Additional Information: | © 2011 Elsevier |
Divisions: | Management |
Subjects: | Q Science > QA Mathematics |
Date Deposited: | 27 Jun 2011 09:28 |
Last Modified: | 11 Dec 2024 23:54 |
URI: | http://eprints.lse.ac.uk/id/eprint/36887 |
Actions (login required)
View Item |