A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
type: Item
instance of: scholarly article
title: A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
zbMATH Open document ID: 1416.90044
author: Sara Mattia
author: Michael Poss
published in: Computational Optimization and Applications
publication date: 2018-04-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6862309
zbMATH Keywords: robust network loading
zbMATH Keywords: budgeted uncertainty
zbMATH Keywords: Benders decomposition
zbMATH Keywords: static routing
zbMATH Keywords: volume routing
zbMATH Keywords: affine routing
zbMATH Keywords: dynamic routing
describes a project that uses: CPLEX
describes a project that uses: SNDlib
MaRDI profile type: Publication
full work available at URL: s10589-017-9956-z
OpenAlex ID: W2767818495
cites work: Design of Survivable Networks Using Three- and Four-Partition Facets
cites work: k-Partition-based facets of the network design problem
cites work: Provisioning virtual private networks under traffic uncertainty
cites work: The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
cites work: Multi-service multi-facility network design under uncertainty
cites work: Metric inequalities and the network loading problem
cites work: Decomposition for adjustable robust linear optimization subject to uncertainty polytope
cites work: Robust capacity assignment solutions for telecommunications networks with uncertain demands
cites work: Network Design Using Cut Inequalities
cites work: Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
cites work: Routing of uncertain traffic demands
cites work: The cut property under demand uncertainty
cites work: Q3182207
cites work: Adjustable robust solutions of uncertain linear programs
cites work: The Price of Robustness
cites work: Minimum cost capacity installation for multicommodity network flows
cites work: Using mixed-integer programming to solve power grid blackout problems
cites work: Single-commodity robust network design with finite and hose demand sets
cites work: Hardness of robust network design
cites work: Robust network design in telecommunications under polytope demand uncertainty
cites work: Designing Least-Cost Nonblocking Broadband Networks
cites work: An improved Benders decomposition applied to a multi-layer network design problem
cites work: Provisioning a virtual private network
cites work: Robust network design: Formulations, valid inequalities, and computations
cites work: Benders decomposition approach for the robust network design problem with flow bifurcations
cites work: The convex hull of two core capacitated network design problems
cites work: Separating tight metric inequalities by bilevel programming
cites work: Solving survivable two-layer network design problems by metric inequalities
cites work: A polyhedral study of the capacity formulation of the multilayer network design problem
cites work: The robust network loading problem with dynamic routing
cites work: Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
cites work: Robust solutions for network design under transportation cost and demand uncertainty
cites work: Robust capacity expansion of network flows
cites work: Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
cites work: A comparison of routing sets for robust network design
cites work: Affine recourse for the robust network design problem: Between static and dynamic routing
cites work: On improving optimal oblivious routing
cites work: Distributionally Robust Convex Optimization
cites work: Solving two-stage robust optimization problems using a column-and-constraint generation method
DOI: 10.1007/S10589-017-9956-Z
description: scientific article; zbMATH DE number 6862309