Metric inequalities and the Network Loading Problem

Authors:
Pasquale Avella;Sara Mattia;Antonio Sassano
Affiliations:
Research Center on Software Technology, Universití del Sannio, Viale Traiano, 82100 Benevento, Italy;Dipartimento di Informatica e Sistemistica, Universití di Roma "La Sapienza", Via Buonarroti, 12, 00185 Roma, Italy;Dipartimento di Informatica e Sistemistica, Universití di Roma "La Sapienza", Via Buonarroti, 12, 00185 Roma, Italy
Venue:
Discrete Optimization
Year:
2007

Citing 13
Cited 8

{0, 12 }-Chva´tal-Gomory cuts

Mathematical Programming: Series A and B
Combinatorial optimization

Combinatorial optimization
Source sink flows with capacity installation in batches

Discrete Applied Mathematics
Minimum cost capacity installation for multicommodity network flows

Mathematical Programming: Series A and B - Special issue on computational integer programming
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

SIAM Journal on Discrete Mathematics
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Network Design Using Cut Inequalities

SIAM Journal on Optimization
A New Min-Cut Max-Flow Ratio for Multicommodity Flows

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

INFORMS Journal on Computing
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research
Geometry of Cuts and Metrics

Geometry of Cuts and Metrics
Totally tight Chvátal-Gomory cuts

Operations Research Letters

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

INFORMS Journal on Computing
A polyhedral approach for solving two facility network design problem

INOC'11 Proceedings of the 5th international conference on Network optimization
The two layer network design problem

INOC'11 Proceedings of the 5th international conference on Network optimization
Solving survivable two-layer network design problems by metric inequalities

Computational Optimization and Applications
An improved Benders decomposition applied to a multi-layer network design problem

Operations Research Letters
Models and algorithms for robust network design with several traffic scenarios

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The robust network loading problem with dynamic routing

Computational Optimization and Applications
Design of Survivable Networks Using Three-and Four-Partition Facets

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a simple graph G(V,E) and a set of traffic demands between the nodes of G, the Network Loading Problem consists of installing minimum cost integer capacities on the edges of G allowing routing of traffic demands. In this paper we study the Capacity Formulation of the Network Loading Problem, introducing the new class of Tight Metric Inequalities, that completely characterize the convex hull of the integer feasible solutions of the problem. We present separation algorithms for Tight Metric Inequalities and a cutting plane algorithm, reporting on computational experience.