Disjunctive programming¶
Balas, E. (1979). Disjunctive programming. Annals of Discrete Mathematics.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Integer Linear Programming (ILP)
- Some instances remain intractable despite solver improvements; formulation strength matters enormously — the same problem formulated differently can solve in a second or not at all; and the art of formulation (choosing variables, writing strong inequalities, structuring disjunctions) requires substantial expertise, drawing on disjunctive-programming foundations laid out by Balas (1979).
This sourceFoundational treatment of disjunctive programming and lift-and-project cuts; provides the polyhedral toolkit underlying many modern MIP cutting-plane families.
- Some instances remain intractable despite solver improvements; formulation strength matters enormously — the same problem formulated differently can solve in a second or not at all; and the art of formulation (choosing variables, writing strong inequalities, structuring disjunctions) requires substantial expertise, drawing on disjunctive-programming foundations laid out by Balas (1979).
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:49ab40883331 · see in the full table