haku: @author Glover, F. / yhteensä: 17
viite: 2 / 17
| Tekijä: | Laguna, M. Glover, F. |
| Otsikko: | Bandwidth packing: a tabu search approach |
| Lehti: | Management Science
1993 : APR, VOL. 39:4, p. 492-500 |
| Asiasana: | TELECOMMUNICATION ALGORITHMS HEURISTIC METHODS ROUTING PROBLEM |
| Kieli: | eng |
| Tiivistelmä: | 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 K-shortest path algorithm, that allows the identification of a controlled set of feasible paths for each call. |
SCIMA