Can I read Metric inequalities and the Network Loading Problem on EtoBox?

Metric inequalities and the Network Loading Problem by Pasquale Avella; Sara Mattia; Antonio Sassano is a Computer Science article available to read on EtoBox.

What is Metric inequalities and the Network Loading Problem about?

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.

Who reads Metric inequalities and the Network Loading Problem?

Author

Pasquale Avella; Sara Mattia; Antonio Sassano

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 1572-5286)

Published

2007

Language

EN

Field

Computer Science (Physical Sciences)