Robust network design: formulations, valid inequalities, and computations
From MaRDI portal
Publication:5326784
DOI10.1002/NET.21497zbMATH Open1269.90029OpenAlexW2161253930MaRDI QIDQ5326784FDOQ5326784
Authors: Arie M. C. A. Koster, Manuel Kutschka, Christian Raack 
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21497
Recommendations
- An approach to robust network design in telecommunications
- Cutset inequalities for robust network design
- Models and algorithms for robust network design with several traffic scenarios
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- An exact algorithm for robust network design
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cites Work
- The Price of Robustness
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Sequence independent lifting in mixed integer programming
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust optimization-methodology and applications
- Linear programming under uncertainty
- Minimum cost capacity installation for multicommodity network flows
- Adjustable robust solutions of uncertain linear programs
- On capacitated network design cut-set polyhedra
- The robust network loading problem with dynamic routing
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
- On cut-based inequalities for capacitated network design polyhedra
- Provisioning virtual private networks under traffic uncertainty
- Hardness of robust network design
- Designing Least-Cost Nonblocking Broadband Networks
- Robust solutions for network design under transportation cost and demand uncertainty
- k-Partition-based facets of the network design problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Routing of uncertain traffic demands
- Metric inequalities and the network loading problem
- A Robust Optimization Approach to Inventory Theory
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Flow pack facets of the single node fixed-charge flow polytope
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- Cutset inequalities for robust network design
- Domination Between Traffic Matrices
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- A branch-and-cut algorithm for capacitated network design problems
- On improving optimal oblivious routing
- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Source sink flows with capacity installation in batches
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Multiperiod network design with incremental routing
- A short proof of the VPN tree routing conjecture on ring networks
- Multi-layer MPLS network design: The impact of statistical multiplexing
Cited In (47)
- Cutset inequalities for robust network design
- Design of survivable wireless backhaul networks with reliability considerations
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Robust two-dose vaccination schemes and the directed \(b\)-matching problem
- On the solution of stochastic optimization and variational problems in imperfect information regimes
- \(k\)-adaptive routing for the robust network loading problem
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Multipolar robust optimization
- Chance-constrained optimization of reliable fixed broadband wireless networks
- An approach to robust network design in telecommunications
- Single-commodity robust network design with finite and hose demand sets
- A robustness approach to uncapacitated network design problems
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis
- Robust combinatorial optimization with variable cost uncertainty
- Robust transshipment problem under consistent flow constraints
- A combined and robust modal-split/traffic assignment model for rail and road freight transport
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Network design in scarce data environment using moment-based distributionally robust optimization
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
- A practicable robust counterpart formulation for decomposable functions: a network congestion case study
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Capacitated network design -- multi-commodity flow formulations, cutting planes, and demand uncertainty
- Robust delay-constrained routing in telecommunications
- A comparison of routing sets for robust network design
- An exact algorithm for robust network design
- Models and algorithms for robust network design with several traffic scenarios
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
- On the chance-constrained minimum spanning \(k\)-core problem
- Robust energy-aware routing with redundancy elimination
- Robust minimum cost flow problem under consistent flow constraints
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- Robust network design in telecommunications under polytope demand uncertainty
- Affine routing for robust network design
- Robust network design with uncertain outsourcing cost
- A new theoretical framework for robust optimization under multi-band uncertainty
- The robust network loading problem with dynamic routing
- Generalized hose uncertainty in single-commodity robust network design
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
- The cut property under demand uncertainty
- Solving a network design problem
- Robust balanced optimization
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Uses Software
This page was built for publication: Robust network design: formulations, valid inequalities, and computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326784)
