Solving linear programming problems in integers¶
Gomory, R. E. (1960). Solving linear programming problems in integers. Combinatorial Analysis.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Integer Linear Programming (ILP)
- Cutting-plane methods, in the lineage Gomory (1960) opened, augment this by adding valid inequalities that strengthen the LP relaxation without affecting integer-feasible solutions.
This sourceAmerican Mathematical Society. Extends and generalizes the 1958 cutting-plane construction; clarifies the role of valid inequalities in strengthening LP relaxations of integer programs.
- Cutting-plane methods, in the lineage Gomory (1960) opened, augment this by adding valid inequalities that strengthen the LP relaxation without affecting integer-feasible solutions.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:0b79d484f4ce · see in the full table