The million-variable ``march for stochastic combinatorial optimization
From MaRDI portal
Publication:2494291
DOI10.1007/s10898-004-5910-6zbMath1098.90045OpenAlexW2145157516MaRDI QIDQ2494291
Publication date: 26 June 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://edoc.hu-berlin.de/18452/8963
Related Items
Scalable branching on dual decomposition of stochastic mixed-integer programming problems, Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs, On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty, On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming, BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems, Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment, Stochastic multi-site capacity planning of TFT-LCD manufacturing using expected shadow-price based decomposition, An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects, Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs, Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems, Problem-driven scenario clustering in stochastic optimization, On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs, Fenchel decomposition for stochastic mixed-integer programming, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, A study of progressive hedging for stochastic integer programming, Two-stage quadratic integer programs with stochastic right-hand sides, A hierarchy of bounds for stochastic mixed-integer programs, Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs, Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning, Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs, A scenario decomposition algorithm for 0-1 stochastic programs, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs, Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs, A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models, Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming, The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming, A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs, Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights, A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty, 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, Stochastic set packing problem, 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, On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables, A comparative study of decomposition algorithms for stochastic combinatorial optimization, A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems, Optimization-Driven Scenario Grouping, Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty, Improving the Integer L-Shaped Method, Observational data-based quality assessment of scenario generation for stochastic programs, On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming, US coast guard air station location with respect to distress calls: a spatial statistics and optimization based methodology, A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
Uses Software
Cites Work
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Dynamic capacity acquisition and assignment under uncertainty
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- A stochastic 0-1 program based approach for the air traffic flow management problem
- Decomposition algorithms for stochastic programming on a computational grid
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Disjunctive Programming
- Robust capacity planning in semiconductor manufacturing
