A computational study of search strategies for mixed integer programming.¶
Linderoth, J. T., & Savelsbergh, M. W. P. (1999). A computational study of search strategies for mixed integer programming. INFORMS Journal on Computing, 11(2), 173-187.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Branch and Bound
- … column generation: the restricted master problem (RMP) uses a small subset of pairings; the pricing subproblem (a shortest-path-with-resource-constraints problem) identifies additional pairings that could improve the RMP solution; new pairings are added, and the process iterates (per Linderoth and Savelsbergh's (1999)
This sourcePARTIAL SUPPORT D42-058: systematic computational comparison of branching and node-selection strategies in MIP branch-and-bound. (NOTE: the marker sentence attaches it to the column-generation/pricing iteration of branch-and-price, but the paper is about B&B search strategies, not column generation — a mild placement mismatch; the source is genuine and relevant to B&B.)
- … column generation: the restricted master problem (RMP) uses a small subset of pairings; the pricing subproblem (a shortest-path-with-resource-constraints problem) identifies additional pairings that could improve the RMP solution; new pairings are added, and the process iterates (per Linderoth and Savelsbergh's (1999)
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
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:e727b115c921 · see in the full table