| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142603 | Operations Research Letters | 2010 | 6 Pages |
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 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Daniel G. Espinoza,