RECORD
Gomory Integer Programs
Optimization and Control · Submitted 5 Jun 2001
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim 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 compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | The set of all group relaxations of an integer program contains certain special members called Gomory relaxations. | background 1.00 | 0.08 | 0.03 | asserted 1.00 |
| s1 | 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. | background 0.99 | 0.21 | 0.06 | asserted 0.99 |
| s2 | In this paper, we characterize Gomory families. | contribution 1.00 | 0.91 | 0.11 | asserted 0.93 |
| s3 | 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. | result 0.60 | 0.87 | 0.25 | asserted 1.00 |
| s4 | The existence of Gomory families is related to the Hilbert covering problems that arose from the conjectures of Sebo. | interpretation 0.50 | 0.34 | 0.07 | asserted 0.99 |
| s5 | Connections to commutative algebra are outlined at the end. | contribution 0.61 | 0.71 | 0.03 | asserted 0.86 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
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.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.