A Class of Cuts and Related Algorithms in Integer Programming
Auteur : Claude-Alain Burdet
Date de publication : 1970
Éditeur : Management Sciences Research Group, Graduate School of Industrial Administration, Carnegie-Mellon University
Nombre de pages : 46
Résumé du livre
A new family of intersection cuts is obtained from a class of convex polyhedra (generalized octahedra). It is shown that these cuts can also be obtained as convex combinations of the Gomory mixed integer cuts. A constructive approach to obtain improved (i.e. deeper) cuts is then presented and discussed. (Author).