Computing with multi-row Gomory cuts

Computing with multi-row Gomory cuts

0.00 Avg rating0 Votes
Article ID: iaor20101727
Volume: 38
Issue: 2
Start Page Number: 115
End Page Number: 120
Publication Date: Mar 2010
Journal: Operations Research Letters
Authors:
Keywords: cutting plane algorithms
Abstract:

Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to Gomory mixed integer (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.

Reviews

Required fields are marked *. Your email address will not be published.