A characterization of the uncapacitated network design polytope

Authors:
Johan Hellstrand;Torbjörn Larsson;Athanasios Migdalas
Affiliations:
Department of Mathematics, Linköping University, Sweden;Department of Mathematics, Linköping University, Sweden;Department of Mathematics, Linköping University, Sweden
Venue:
Operations Research Letters
Year:
1992

Citing 2
Cited 1

Polytopes, graphs and optimisation

Polytopes, graphs and optimisation
Theory of linear and integer programming

Theory of linear and integer programming

Mathematical modeling for optimal design of in-building distributed antenna systems

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The uncapacitated network design problem is considered. We show that the feasible polytope of the continuous relaxation of this problem has the property that any path along the edges of the convex hull of its integer points is also a path along the edges of the polytope itself. This property may be of computational interest since it implies the possibility of solving the uncapacitated network design problem by a pivoting scheme.