Publication: Solving the capacitated local access network design problem
Loading...
Program
KU-Authors
Organization Authors
Co-Authors
Ravi, R.
Hooker, John N.
Date
Language
Type
Embargo Status
N/A
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes to a sink node and to install transmission facilities on the edges of the graph to accommodate the flow at minimum cost. We give a branch-and-bound algorithm that solves relaxations obtained by approximating the noncontinuous cost function by its lower convex envelope. The approximations are refined by branching on the flow ranges on selected edges. Our computational experiments indicate that this method is effective in solving moderate-size problems and provides very good candidate solutions early in the branch-and-bound tree.
Source
Publisher
The Institute for Operations Research and the Management Sciences (INFORMS)
Citation
item.page.haspartof
Source
Informs Journal on Computing
item.page.ispartofseries
item.page.edition
DOI
10.1287/ijoc.1070.0237
item.page.datauri
item.page.link
Rights
N/A
Copyrights Note
Rights and licensing
N/A
