Stochastic survivable network design problems: theory and practice
From MaRDI portal
Publication:1752199
DOI10.1016/j.ejor.2016.06.048zbMath1394.90450OpenAlexW2344180247WikidataQ56976929 ScholiaQ56976929MaRDI QIDQ1752199
Bernd Zey, Ivana Ljubić, Petra Mutzel
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.06.048
stochastic integer programmingBenders decompositionbranch \& cutinteger L-shaped methodstochastic network design problems
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems, Decomposition methods for the two-stage stochastic Steiner tree problem, A two-stage robust model for a reliable \(p\)-center facility location problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-cut algorithm for two-level survivable network design problems
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- Design of survivable networks
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Stochastic programming with integer variables
- Analyzing the quality of the expected value solution in stochastic programming
- On generating maximal nondominated Benders cuts
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- A note on the selection of Benders' cuts
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Modeling with Stochastic Programming
- Exact approaches to the single-source network loading problem
- Introduction to Stochastic Programming
- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- The k-Edge-Connected Spanning Subgraph Polyhedron
- Connectivity-splitting models for survivable network design
- Chance‐constrained multi‐terminal network design problems
- Strong formulations for network design problems with connectivity requirements
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Online and stochastic survivable network design
- Design of Survivable Networks: A survey
- Stabilizing branch‐and‐price for constrained tree problems
- LP Rounding Approximation Algorithms for Stochastic Network Design
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
