search query: @author Magnanti, T. L. / total: 4
reference: 2 / 4
| Author: | Balakrishnan, A. Magnanti, T. L. Wong, R. T. |
| Title: | A dual-ascent procedure for large-scale uncapacitated network design. |
| Journal: | Operations Research
1989 : SEP-OCT, VOL. 37:5, p. 716-740 |
| Index terms: | NETWORKS ALGORITHMS INTEGER PROGRAMMING |
| Language: | eng |
| Abstract: | Uncapacitated network design problems are addressed that are relevant to production and telecommunications planning. A dual-based approach is introduced. It is shown how the ascent procedure can be viewed as a generalization of the shortest path algorithm and of the dual-ascent procedure of the network problem, which generalizes the ascent algorithm for uncapacitated plant location, as well as the directed spanning tree algorithm. The dual-ascent heuristic solution procedure computes a lower bound for the design problem, and also provides information for determining a feasible design. A drop-add procedure improves the quality of the solution. |
SCIMA