search query: @author Altinkemer, K. / total: 5
reference: 5 / 5
« previous | next »
| Author: | Altinkemer, K. Gavish, B. |
| Title: | Heuristics with constant error guarantees for the design of tree networks. |
| Journal: | Management Science
1988 : MAR, VOL. 34:3, p. 331-341 |
| Index terms: | GRAPHS NETWORKS |
| Language: | eng |
| Abstract: | A tree network is a collection of trees rooted at a common central node. Several types of network design problems can be viewed as requiring the formation of a spanning tree network of minimum length, subject to a bound on the sum of weights on the nodes of any component tree. Experience has shown that only small examples can be solved to optimality. There is described an efficient heuristic algorithm based on partitioning of a traveling salesman tour. The computational experiments with different variants of the parallel savings heuristic showed that the algorithm generates good solutions. |
« previous | next »
SCIMA