Article ID: | iaor19992371 |
Country: | South Korea |
Volume: | 23 |
Issue: | 2 |
Start Page Number: | 29 |
End Page Number: | 46 |
Publication Date: | Jun 1998 |
Journal: | Journal of the Korean ORMS Society |
Authors: | Cho Geon |
Keywords: | telecommunications |
In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network (LATN) design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column Generation procedure in just