An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
From MaRDI portal
Publication:256673
DOI10.1007/s10479-015-1899-0zbMath1332.90183OpenAlexW432253752WikidataQ57397201 ScholiaQ57397201MaRDI QIDQ256673
Publication date: 9 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1899-0
stochastic programmingquadratic programmingconvex programmingouter approximationbranch-and-fix coordination methodmixed-integer nonlinear programming
Convex programming (90C25) Mixed integer programming (90C11) Nonlinear programming (90C30) Stochastic programming (90C15)
Related Items (5)
Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation ⋮ Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs ⋮ A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables ⋮ A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables ⋮ Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- An algorithmic framework for convex mixed integer nonlinear programs
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- An Algorithm for Two-Stage Stochastic Quadratic Problems
- Solving Electric Market Quadratic Problems by Branch and Fix Coordination Methods
- Applications of Stochastic Programming
- Programming Under Uncertainty: The Equivalent Convex Program
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
This page was built for publication: An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
