Linear Programming¶
Chvátal, V. (1983). Linear Programming.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Linear Programming (LP)
- The complexity-management leverage is enormous: problems that would be intractable as unstructured search become routinely solvable as LP; problems with millions of variables and constraints are solved in seconds to minutes on commodity hardware.
This sourceW. H. Freeman. (Accessible textbook with geometric intuition and hands-on formulation building blocks.)
- The complexity-management leverage is enormous: problems that would be intractable as unstructured search become routinely solvable as LP; problems with millions of variables and constraints are solved in seconds to minutes on commodity hardware.
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:2a13544e8a5f · see in the full table