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¶
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:9477be5ad229 · see in the full table