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).
Springer Science & Business Media
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
RLSCG uses reinforcement learning to adaptively select stabilization parameters in column generation, substantially reducing iterations and runtime on cutting stock problems compared to fixed rules and other learning baselines.
PACE interleaves active generation of diverse learners with subsequent pruning to produce smaller ensembles that retain performance and offer faithfulness guarantees.
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).
-
PACE: Prune-And-Compress Ensemble Models
PACE interleaves active generation of diverse learners with subsequent pruning to produce smaller ensembles that retain performance and offer faithfulness guarantees.