Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
From MaRDI portal
Publication:1621689
DOI10.1007/S12532-017-0128-ZzbMath1400.90236OpenAlexW2766886803MaRDI QIDQ1621689
Publication date: 9 November 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-017-0128-z
Mixed integer programming (90C11) Stochastic programming (90C15) Parallel numerical computation (65Y05) Decomposition methods (49M27)
Related Items (14)
A new interior-point approach for large separable convex quadratic two-stage stochastic problems ⋮ Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs ⋮ On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty ⋮ On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs ⋮ On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach ⋮ Mixed spatial and temporal decompositions for large-scale multistage stochastic optimization problems ⋮ An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming ⋮ Electric power infrastructure planning under uncertainty: stochastic dual dynamic integer programming (SDDiP) and parallelization scheme ⋮ Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs ⋮ Asynchronous Lagrangian scenario decomposition ⋮ A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ DSP ⋮ A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
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
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- SCIP: solving constraint integer programs
- About Lagrangian methods in integer optimization
- Cutting planes and column generation techniques with the projective algorithm
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Dual decomposition in stochastic integer programming
- Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
- Integration of progressive hedging and dual decomposition in stochastic integer programs
- Decomposition algorithms for stochastic programming on a computational grid
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- New developments in the primal-dual column generation technique
- PySP: modeling and solving stochastic programs in Python
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- On parallelizing dual decomposition in stochastic integer programming
- A scenario decomposition algorithm for 0-1 stochastic programs
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- A stochastic programming approach for supply chain network design under uncertainty
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management
- Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
- Julia: A Fresh Approach to Numerical Computing
- Introduction to Stochastic Programming
- Progressive hedging-based metaheuristics for stochastic network design
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- Computing in Operations Research Using Julia
- Solving Real-World Linear Programs: A Decade and More of Progress
- On the Implementation of a Primal-Dual Interior Point Method
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
- Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
- Object-oriented software for quadratic programming
- A comprehensive input format for stochastic linear programs
This page was built for publication: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
