Solving large-scale zero-one linear programming problems¶
Crowder, H., Johnson, & Padberg, M. (1983). Solving large-scale zero-one linear programming problems. Operations Research, 31(5), 803-834.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Integer Linear Programming (ILP)
- For combinatorial problems where the number of potential solutions is astronomical, MIP provides the only practical route to near-optimal solutions with provable quality guarantees, as Crowder, Johnson, and Padberg (1983) demonstrated when they showed that real large-scale 0-1 linear programs were tractable through a disciplined MIP attack.
This sourceDemonstrates that disciplined preprocessing, cutting planes, and branch-and-bound make large 0-1 ILPs routinely tractable; an early benchmark for MIP solver capability.
- For combinatorial problems where the number of potential solutions is astronomical, MIP provides the only practical route to near-optimal solutions with provable quality guarantees, as Crowder, Johnson, and Padberg (1983) demonstrated when they showed that real large-scale 0-1 linear programs were tractable through a disciplined MIP attack.
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.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
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:9477be5ad229 · see in the full table