A comparative study of decomposition algorithms for stochastic combinatorial optimization
From MaRDI portal
Publication:1001189
DOI10.1007/s10589-007-9085-1zbMath1153.90515MaRDI QIDQ1001189
Publication date: 13 February 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://edoc.hu-berlin.de/18452/9000
Disjunctive decomposition; Stochastic mixed-integer programming; Stochastic server location; Strategic supply chain planning
Related Items
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs, A comparative study of decomposition algorithms for stochastic combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- Partitioning procedures for solving mixed-variables programming problems
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- Schumann, a modeling framework for supply chain management under uncertainty
- The sample average approximation method applied to stochastic routing problems: a computational study
- Computational solution of capacity planning models under uncertainty
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- The million-variable ``march for stochastic combinatorial optimization
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- Disjunctive Programming
- Facility location models for immobile servers with stochastic demand