Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs
From MaRDI portal
Publication:2901080
DOI10.1287/ijoc.1080.0300zbMath1243.90152OpenAlexW2116334462MaRDI QIDQ2901080
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1080.0300
Related Items (12)
Towards a sustainable power grid: stochastic hierarchical planning for high renewable integration ⋮ An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects ⋮ A stochastic programming approach for chemotherapy appointment scheduling ⋮ Stochastic last mile relief network design with resource reallocation ⋮ Two-stage stochastic, large-scale optimization of a decentralized energy system: a case study focusing on solar PV, heat pumps and storage in a residential quarter ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching ⋮ Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs ⋮ The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming ⋮ The stochastic capacitated branch restructuring problem ⋮ Stochastic set packing problem ⋮ Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints
This page was built for publication: Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs
