SIPLIB

swMATH9652MaRDI QIDQ21631FDOQ21631

Author name not available (Why is that?)

Cited In (19)

• Observational data-based quality assessment of scenario generation for stochastic programs
• Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
• Analysis of stochastic problem decomposition algorithms in computational grids
• Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
• Improving the integer L-shaped method
• Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• A decomposition-based crash-start for stochastic programming
• Asynchronous Lagrangian scenario decomposition
• Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic
• Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs
• Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
• Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
• Optimization-Driven Scenario Grouping
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
• Covering Linear Programming with Violations
• A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
• The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty

This page was built for software: SIPLIB