Computing with Multi-row Gomory Cuts

8 years 4 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cuts. In this paper, we investigate the computational impact of using a subclass of minimally-valid inequalities from this relaxation on a wide set of instances. Key words: mixed integer programming, cutting planes, multiple constraints. 2000 MSC: 90C11, 2000 MSC: 90C57
Daniel G. Espinoza
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where IPCO
Authors Daniel G. Espinoza
Comments (0)