| Author | dc.contributor.author | Espinoza González, Daniel | |
| Admission date | dc.date.accessioned | 2010-06-17T18:41:21Z | |
| Available date | dc.date.available | 2010-06-17T18:41:21Z | |
| Publication date | dc.date.issued | 2008 | |
| Cita de ítem | dc.identifier.citation | A. Lodi, A. Panconesi, and G. Rinaldi (Eds.): IPCO 2008, LNCS 5035, pp. 214–224, 2008. | en_US |
| Identifier | dc.identifier.uri | https://repositorio.uchile.cl/handle/2250/125350 | |
| Abstract | dc.description.abstract | Cutting planes for mixed integer problems (MIP) are nowadays
an integral part of all general purpose software to solve MIP. The
most prominent,and computationally significant, class of general cutting
planes are Gomory mixed integer cuts (GMI). However finding other
classes of general cuts for MIP that work well in practice has been elusive.
Recent advances on the understanding of valid inequalities derived
from the infinite relaxation introduced by Gomory and Johnson for mixed
integer problems, has opened a new possibility of finding such an extension.
In this paper, we investigate the computational impact of using a
subclass of minimal valid inequalities from the infinite relaxation, using
different number of tableau rows simultaneously, based on a simple separation
procedure.We test these ideas on a set of MIPs, including MIPLIB
3.0 and MIPLIB 2003, and show that they can improve MIP performance
even when compared against commercial software performance. | en_US |
| Patrocinador | dc.description.sponsorship | This research was partially funded by FONDECYT grant 1070749 and by ICM grant
P05-004F. | en_US |
| Lenguage | dc.language.iso | en | en_US |
| Publisher | dc.publisher | Springer-Verlag Berlin Heidelberg | en_US |
| Título | dc.title | Computing with Multi-row Gomory Cuts | en_US |
| Document type | dc.type | Artículo de revista | |
