Article ID: | iaor1994307 |
Country: | United States |
Volume: | 39 |
Start Page Number: | 17 |
End Page Number: | 29 |
Publication Date: | Apr 1993 |
Journal: | Management Science |
Authors: | Glover Fred, Laguna Manuel |
Keywords: | communication, search, heuristics |
The bandwidth packing (BWP) problem is a combinatorially difficult problem arising in the area of telecommunications. The problem consists of assigning calls to paths in a capacitated graph, such that capacities are not violated and the total profit is maximized. In this paper the authors discuss the development of a tabu search (TS) method for the BWP problem. The method makes use of an efficient implementation of the