Gomory Integer Programs
| dc.creator | Hosten, Serkan | |
| dc.creator | Thomas, Rekha R. | |
| dc.date | 2001-06-05 | |
| dc.date.accessioned | 2026-07-07T04:42:00Z | |
| dc.date.available | 2026-07-07T04:42:00Z | |
| dc.description | The set of all group relaxations of an integer program contains certain special members called Gomory relaxations. A family of integer programs with a fixed coefficient matrix and cost vector but varying right hand sides is a Gomory family if every program in the family can be solved by one of its Gomory relaxations. In this paper, we characterize Gomory families. Every TDI system gives a Gomory family, and we construct Gomory families from matrices whose columns form a Hilbert basis for the cone they generate. The existence of Gomory families is related to the Hilbert covering problems that arose from the conjectures of Sebo. Connections to commutative algebra are outlined at the end. | |
| dc.description | 23 pages | |
| dc.identifier | https://arxiv.org/abs/math/0106031 | |
| dc.identifier | http://arxiv.org/abs/math/0106031 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61592 | |
| dc.subject | Optimization and Control | |
| dc.subject | Combinatorics | |
| dc.title | Gomory Integer Programs | |
| dc.type | text |