| Article ID: | iaor19921868 |
| Country: | Switzerland |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 77 |
| End Page Number: | 86 |
| Publication Date: | May 1992 |
| Journal: | Annals of Operations Research |
| Authors: | Simchi-Levi David, Gavish Bezalel, Li Chung-Lun |
| Keywords: | heuristics |
The authors 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. The authors also generalize the heuristics to the multi-center case with the same worst-case bounds.