On the chance-constrained minimum spanning \(k\)-core problem
From MaRDI portal
Publication:2274857
DOI10.1007/s10898-018-0714-2zbMath1428.90172MaRDI QIDQ2274857
Juan Ma, Balabhaskar Balasundaram
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0714-2
chance-constrained optimization; hop-constrained survivable network design; minimum spanning \(k\)-core
90C35: Programming involving graphs or networks
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-and-cut algorithm for two-level survivable network design problems
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- An integer programming approach for linear programs with probabilistic constraints
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Topology design for on-demand dual-path routing in wireless networks
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
- On intersection of two mixing sets with applications to joint chance-constrained programs
- On mixing sets arising in chance-constrained programming
- Survivable network design under optimal and heuristic interdiction scenarios
- Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
- The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures
- Network reliability design via joint probabilistic constraints
- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Airline network design and hub location problems
- Strong formulations for network design problems with connectivity requirements
- Design of Survivable Networks: A survey
- Robust network design: Formulations, valid inequalities, and computations
- Hop‐level flow formulation for the survivable network design with hop constraints problem
- Robustness and Strong Attack Tolerance of Low-Diameter Networks
