Computing with multi-row Gomory cuts |
| |
| Authors: | Daniel G. Espinoza |
| |
| Affiliation: | Departamento de Ingeniería Industrial, Universidad de Chile, Av. República 701, Santiago, 837-0439, Chile |
| |
| 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. |
| |
| Keywords: | Mixed integer programming Cutting planes Multiple constraints |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
