Robust network design: formulations, valid inequalities, and computations
From MaRDI portal
Publication:5326784
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
Cites work
- A Robust Optimization Approach to Inventory Theory
- A branch-and-cut algorithm for capacitated network design problems
- A short proof of the VPN tree routing conjecture on ring networks
- Adjustable robust solutions of uncertain linear programs
- Capacitated Network Design—Polyhedral Structure and Computation
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
- Cutset inequalities for robust network design
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Designing Least-Cost Nonblocking Broadband Networks
- Domination Between Traffic Matrices
- Flow pack facets of the single node fixed-charge flow polytope
- Hardness of robust network design
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Linear programming under uncertainty
- Metric inequalities and the network loading problem
- Minimum cost capacity installation for multicommodity network flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Multi-layer MPLS network design: The impact of statistical multiplexing
- Multiperiod network design with incremental routing
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- On improving optimal oblivious routing
- Provisioning virtual private networks under traffic uncertainty
- Robust discrete optimization and network flows
- Robust optimization-methodology and applications
- Robust solutions for network design under transportation cost and demand uncertainty
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Routing of uncertain traffic demands
- Sequence independent lifting in mixed integer programming
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Source sink flows with capacity installation in batches
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- The robust network loading problem with dynamic routing
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
- k-Partition-based facets of the network design problem
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
- 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
- On the solution of stochastic optimization and variational problems in imperfect information regimes
- Robust two-dose vaccination schemes and the directed \(b\)-matching problem
- 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
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- A robustness approach to uncapacitated network design problems
- Robust combinatorial optimization with variable cost uncertainty
- Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis
- 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
- Robust delay-constrained routing in telecommunications
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- A comparison of routing sets for robust network design
- Capacitated network design -- multi-commodity flow formulations, cutting planes, and demand uncertainty
- 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 energy-aware routing with redundancy elimination
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- On the chance-constrained minimum spanning \(k\)-core problem
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
- 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
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
- Generalized hose uncertainty in single-commodity robust network design
- The robust network loading problem with dynamic routing
- A new theoretical framework for robust optimization under multi-band 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
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)
