Solving linear programming problems in integers

Gomory, R. E. (1960). Solving linear programming problems in integers. Combinatorial Analysis.

Type

Book chapter

Intellectual base

Review or monograph

Year

1960

Pages cited

211-215

DOI registrant

American Mathematical Society

Link

https://doi.org/10.1090/psapm/010/0114670matched

Cited from

operations_research

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.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:0b79d484f4ce · see in the full table