A new cross decomposition method for stochastic mixed-integer linear programming
From MaRDI portal
Publication:1752218
DOI10.1016/j.ejor.2016.08.005zbMath1394.90440OpenAlexW2515859521MaRDI QIDQ1752218
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1974/27983
stochastic programmingDantzig-Wolfe decompositionBenders decompositionmixed-integer linear programmingcross decomposition
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Related Items
Scalable branching on dual decomposition of stochastic mixed-integer programming problems, A polynomial-time algorithm with tight error bounds for single-period unit commitment problem, A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems, Whole blood or apheresis donations? A multi-objective stochastic optimization approach, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- A branch-price-and-cut algorithm for multi-mode resource leveling
- Branching in branch-and-price: A generic scheme
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- On the convergence of cross decomposition
- About Lagrangian methods in integer optimization
- Bender's method revisited
- Partitioning procedures for solving mixed-variables programming problems
- Mean value cross decomposition applied to integer programming problems
- Dual decomposition in stochastic integer programming
- Solving binary cutting stock problems by column generation and branch- and-bound
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Generalized Benders decomposition
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- GUSS: Solving Collections of Data Related Models Within GAMS
- Decomposition Principle for Linear Programs
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Reformulation of the Multiperiod MILP Model for Capacity Expansion of Chemical Processes
- The Engine Scheduling Problem In A Railway Network
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Cross decomposition for mixed integer programming
- A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs
- Validation of subgradient optimization
- Column Generation
- Selected Topics in Column Generation
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
