Integer Programming¶
Wolsey, L. A. (1998). Integer Programming. Wiley.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Branch and Bound
- The sophistication of the bounding procedure directly controls pruning effectiveness — stronger bounds prune more (as demonstrated in foundational theory by Wolsey (1998)
This sourcestandard graduate text developing branch-and-bound, cutting planes, and strong valid inequalities, including bound-strengthening through valid inequalities.
- The sophistication of the bounding procedure directly controls pruning effectiveness — stronger bounds prune more (as demonstrated in foundational theory by Wolsey (1998)
- Integer Linear Programming (ILP)
- In machine learning and statistics, ILP and its relaxations support feature selection, clustering, classification, and various other problems with discrete structure — Wolsey's (1998) Integer Programming text remains the standard graduate-level entry point to these tools.
This sourceStandard graduate textbook on integer programming; develops branch-and-bound, cutting planes, and branch-and-cut as the core algorithmic toolkit and discusses bound-strengthening through valid inequalities.
- In machine learning and statistics, ILP and its relaxations support feature selection, clustering, classification, and various other problems with discrete structure — Wolsey's (1998) Integer Programming text remains the standard graduate-level entry point to these tools.
- Linear Programming (LP)
This sourceStandard graduate textbook on integer programming; develops branch-and-bound, cutting planes, and branch-and-cut as the core algorithmic toolkit and discusses bound-strengthening through valid inequalities.
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:29759d486c44 · see in the full table