With high probability, Branch-and-Price explores at most n^O(log s) nodes for typical two-stage stochastic binary IPs, supported by an average-case integrality gap bound of O((log s log^2 n)/n).
The ben- ders decomposition algorithm: A literature review.European Journal of Operational Research, 259(3):801–817
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
With high probability, Branch-and-Price explores at most n^O(log s) nodes for typical two-stage stochastic binary IPs, supported by an average-case integrality gap bound of O((log s log^2 n)/n).