The robust network loading problem with dynamic routing

Authors:
Sara Mattia
Affiliations:
IASI, Istituto di Analisi dei Sistemi ed Informatica, CNR, Consiglio Nazionale delle Ricerche, Rome, Italy 00185
Venue:
Computational Optimization and Applications
Year:
2013

Citing 18
Cited 0

The convex hull of two core capacitated network design problems

Mathematical Programming: Series A and B
The Steiner tree problem I: formulations, compositions and extension of facets

Mathematical Programming: Series A and B
Designing least-cost nonblocking broadband networks

Journal of Algorithms
Minimum cost capacity installation for multicommodity network flows

Mathematical Programming: Series A and B - Special issue on computational integer programming
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Provisioning a virtual private network: a network design problem for multicommodity flow

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Network Design Using Cut Inequalities

SIAM Journal on Optimization
k-Partition-based facets of the network design problem

Networks
Provisioning virtual private networks under traffic uncertainty

Networks - Special Issue on Multicommodity Flows and Network Design
Hardness of robust network design

Networks
Domination Between Traffic Matrices

Mathematics of Operations Research
Two-Stage Robust Network Flow and Design Under Demand Uncertainty

Operations Research
Communication: Robust network optimization under polyhedral demand uncertainty is NP-hard

Discrete Applied Mathematics
Geometry of Cuts and Metrics

Geometry of Cuts and Metrics
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

INFORMS Journal on Computing
On cut-based inequalities for capacitated network design polyhedra

Networks
Solving survivable two-layer network design problems by metric inequalities

Computational Optimization and Applications
Metric inequalities and the Network Loading Problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the Robust Network Loading problem with splittable flows and dynamic routing under polyhedral uncertainty for the demands is considered. Polyhedral results for the capacity formulation of the problem are given. The first exact approach for solving the problem is presented. A branch-and-cut algorithm based on the proposed capacity formulation is developed. Computational results using the hose polyhedron to model the demand uncertainty are discussed.