A Class of Cuts and Related Algorithms in Integer Programming.
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
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
- Operations Research