Title
Algorithms for a multi-level network optimization problem
Abstract
In this paper we work on a multi-level network optimization problem that integrates into the same model important aspects of: (i) discrete facility location, (ii) topological network design, and (iii) network dimensioning. Potential applications for the model are discussed, stressing its growing importance. The multi-level network optimization problem treated is defined and a mathematical programming formulation is presented. We make use of a branch-and-bound algorithm based on Lagrangean relaxation lower bounds to introduce some new powerful auxiliary algorithms to exactly solve the problem. We conduct a set of computational experiments that indicate the quality of the proposed approach.
Year
DOI
Venue
1999
10.1016/S0377-2217(98)00306-3
European Journal of Operational Research
Keywords
Field
DocType
Branch-and-bound,Network programming,Location,Topological network design,Network flows
Flow network,Computational problem,Branch and bound,Mathematical optimization,Network planning and design,Algorithm,Facility location problem,Dimensioning,Optimization problem,Mathematics,Computer network programming
Journal
Volume
Issue
ISSN
118
1
0377-2217
Citations 
PageRank 
References 
7
1.22
20
Authors
3
Name
Order
Citations
PageRank
Frederico R. B. Cruz1469.02
J. MacGregor Smith249661.72
Geraldo Robson Mateus341342.30