Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
From MaRDI portal
Publication:744205
DOI10.1007/S12532-013-0058-3zbMATH Open1330.90057OpenAlexW2044698871MaRDI QIDQ744205FDOQ744205
Publication date: 6 October 2014
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-013-0058-3
Recommendations
- Chance-constrained multi-terminal network design problems
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- Stochastic survivable network design problems: theory and practice
- Network design with probabilistic capacities
- Network reliability design via joint probabilistic constraints
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uncertain convex programs: randomized solutions and confidence levels
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Conflict analysis in mixed integer programming
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Scenario Approach to Robust Control Design
- Convex Approximations of Chance Constrained Programs
- On mixing sets arising in chance-constrained programming
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Strong formulations for network design problems with connectivity requirements
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Stochastic network interdiction
- The Probabilistic Set-Covering Problem
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- The mixed vertex packing problem.
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Mixing mixed-integer inequalities
- MIP reformulations of the probabilistic set covering problem
- An integer programming approach for linear programs with probabilistic constraints
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Scenario approximations of chance constraints
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Mathematical programming algorithms for two-path routing problems with reliability considerations
- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
- On the spanning tree polyhedron
- An integer linear programming approach to the steiner problem in graphs
- Network reliability design via joint probabilistic constraints
- Separation of partition inequalities
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
Cited In (16)
- Non-parametric stochastic subset optimization for reliability-based importance ranking of bridges in transportation networks
- Optimal Network Design with End-to-End Service Requirements
- Decomposition algorithms for two-stage chance-constrained programs
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- Optimization algorithms for resilient path selection in networks
- Exact reliability optimization for series‐parallel graphs using convex envelopes
- Branch-and-cut methods for the network design problem with vulnerability constraints
- On the chance-constrained minimum spanning \(k\)-core problem
- Risk-averse shortest path interdiction
- Chance-constrained set covering with Wasserstein ambiguity
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- Stochastic survivable network design problems: theory and practice
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- A polyhedral study of the static probabilistic lot-sizing problem
- Topological optimization of reliable networks under dependent failures
Uses Software
This page was built for publication: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744205)
