Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
From MaRDI portal
Publication:744205
DOI10.1007/s12532-013-0058-3zbMath1330.90057OpenAlexW2044698871MaRDI QIDQ744205
Yongjia Song, James R. Luedtke
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
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)
Related Items (14)
Decomposition algorithms for two-stage chance-constrained programs ⋮ Network Design with Service Requirements: Scaling-up the Size of Solvable Problems ⋮ Exact reliability optimization for series‐parallel graphs using convex envelopes ⋮ A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ Optimal Network Design with End-to-End Service Requirements ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs ⋮ Stochastic survivable network design problems: theory and practice ⋮ On the chance-constrained minimum spanning \(k\)-core problem ⋮ Optimization algorithms for resilient path selection in networks ⋮ Topological optimization of reliable networks under dependent failures ⋮ Risk-Averse Shortest Path Interdiction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- 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
- On the spanning tree polyhedron
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Uncertain convex programs: randomized solutions and confidence levels
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- On mixing sets arising in chance-constrained programming
- Conflict analysis in mixed integer programming
- Separation of Partition Inequalities
- Stochastic Network Interdiction
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
- Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Network reliability design via joint probabilistic constraints
- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Probabilistic Set-Covering Problem
- An integer linear programming approach to the steiner problem in graphs
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- Strong formulations for network design problems with connectivity requirements
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- The Scenario Approach to Robust Control Design
- Convex Approximations of Chance Constrained Programs
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- The mixed vertex packing problem.
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Mixing mixed-integer inequalities
This page was built for publication: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
