论文信息 - Analysis of heuristics for the design of tree networks

Analysis of heuristics for the design of tree networks

We analyze the tour partitioning heuristics for the Capacitated Minimum Spanning Tree problem. Lower bounds for the worst-case performance ratios of these heuristics are obtained by using worst-case examples. We also generalize the heuristics to the multi-center case with the same worst-case bounds.

Chung-Lun Li | David Simchi-Levi | Bezalel Gavish

[1] B. Gavish,et al. Heuristics for unequal weight delivery problems with a fixed error guarantee , 1987 .

[2] Bezalel Gavish,et al. Technical Note - Heuristics for Delivery Problems with Constant Error Guarantees , 1990, Transp. Sci..

[3] Christos H. Papadimitriou,et al. The complexity of the capacitated tree problem , 1978, Networks.

[4] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[5] B. Gavish,et al. Heuristics with Constant Error Guarantees for the Design of Tree Networks , 1988 .

[6] Chung-Lun Li,et al. Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems , 1990, INFORMS J. Comput..

[7] John E. Beasley,et al. Route first--Cluster second methods for vehicle routing , 1983 .

[8] K Altinkemer,et al. HEURISTICS FOR DELIVERY PROBLEMS WITH CONSTANT ERROR GUARANTEES. TECHNICAL NOTE , 1990 .