Robust network design: Formulations, valid inequalities, and computations

DOI10.1002/NET.21497zbMath1269.90029OpenAlexW2161253930MaRDI QIDQ5326784

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

zbMATH Keywords

robust optimizationnetwork designpolyhedral combinatorics

Mathematics Subject Classification ID

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)

Related Items (27)

Robust combinatorial optimization with variable cost uncertainty ⋮ Single-commodity robust network design problem: complexity, instances and heuristic solutions ⋮ The robust network loading problem with dynamic routing ⋮ Robust Metric Inequalities for Network Loading Under Demand Uncertainty ⋮ Robust Network Design with Uncertain Outsourcing Cost ⋮ 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 combined and robust modal-split/traffic assignment model for rail and road freight transport ⋮ Robust energy-aware routing with redundancy elimination ⋮ Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ Generalized hose uncertainty in single-commodity robust network design ⋮ Robust minimum cost flow problem under consistent flow constraints ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ Design of survivable wireless backhaul networks with reliability considerations ⋮ Robust transshipment problem under consistent flow constraints ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ A comparison of routing sets for robust network design ⋮ Multipolar robust optimization ⋮ Robust balanced optimization ⋮ \(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 ⋮ A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty ⋮ On the chance-constrained minimum spanning \(k\)-core problem ⋮ Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty ⋮ On the Solution of Stochastic Optimization and Variational Problems in Imperfect Information Regimes ⋮ A Lagrangian dual method for two-stage robust optimization with binary uncertainties

Uses Software

• CPLEX
• Unnamed Item

Cites Work

• Routing of uncertain traffic demands
• On improving optimal oblivious routing
• A short proof of the VPN tree routing conjecture on ring networks
• Source sink flows with capacity installation in batches
• Minimum cost capacity installation for multicommodity network flows
• Robust solutions of uncertain linear programs
• Robust discrete optimization and network flows
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Adjustable robust solutions of uncertain linear programs
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Robust solutions of linear programming problems contaminated with uncertain data
• A branch-and-cut algorithm for capacitated network design problems
• On capacitated network design cut-set polyhedra
• Robust optimization-methodology and applications
• Sequence independent lifting in mixed integer programming
• The robust network loading problem with dynamic routing
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Multi-layer MPLS network design: The impact of statistical multiplexing
• Metric inequalities and the network loading problem
• Linear Programming under Uncertainty
• Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
• The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
• On cut-based inequalities for capacitated network design polyhedra
• Cutset Inequalities for Robust Network Design
• A Robust Optimization Approach to Inventory Theory
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Provisioning virtual private networks under traffic uncertainty
• Hardness of robust network design
• Multiperiod network design with incremental routing
• The Price of Robustness
• Designing Least-Cost Nonblocking Broadband Networks
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Robust solutions for network design under transportation cost and demand uncertainty
• Domination Between Traffic Matrices
• k-Partition-based facets of the network design problem
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Capacitated Network Design—Polyhedral Structure and Computation
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Flow pack facets of the single node fixed-charge flow polytope

This page was built for publication: Robust network design: Formulations, valid inequalities, and computations