Skip to main content
SpringerLink
Log in

Analysis of heuristics for the design of tree networks

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Altinkemer and B. Gavish, Heuristics for equal weight delivery problems with constant error guarantees, Transp. Sci. 24 (1990) 294–297.

    Google Scholar 

  2. K. Altinkemer and B. Gavish, Heuristics for unequal weight delivery problems with a fixed error guarantee, Oper. Res. Lett. 6 (1987) 149–158.

    Google Scholar 

  3. K. Altinkemer and B. Gavish, Heuristics with constant error guarantees for the design of tree networks, Manag. Sci. 34 (1988) 331–341.

    Google Scholar 

  4. J. Beasley, Route first-cluster second methods for vehicle routing, Omega 11 (1983) 403–408.

    Google Scholar 

  5. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388 Graduate School of Industrial Administration, Carnegie-Mellon University (1976).

  6. C.L. Li and D. Simchi-Levi, Worst-case analysis of heuristic for multi-depot capacitated vehicle routing problems, ORSA J. Comput. 2 (1990) 64–73.

    Google Scholar 

  7. C.H. Papadimitriou, The complexity of the capacitated tree problem, Networks 8 (1978) 217–230.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Owen Graduate School of Management, Vanderbilt University, 37203, Nashville, TN, USA

    Bezalel Gavish

  2. John M. Olin School of Business, Washington University, 63130, St. Louis, MO, USA

    Chung-Lun Li

  3. Department of Industrial Engineering and Operations Research, Columbia University, 10027, New York, NY, USA

    David Simchi-Levi

Authors
  1. Bezalel Gavish
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chung-Lun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Simchi-Levi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work of the first author was supported by a Dean Summer Research Grant from Owen Graduate School of Management, Vanderbilt University.

Work done in part in the Department of Industrial Engineering and Operations Research at Columbia University.

The work of the last two authors was supported in part by ONR contract N00014-90-J-1649, NSF contract DDM-8922712 and the Center for Telecommunications Research under NSF contract CDR 84-21402.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gavish, B., Li, CL. & Simchi-Levi, D. Analysis of heuristics for the design of tree networks. Ann Oper Res 36, 77–86 (1992). https://doi.org/10.1007/BF02094324

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02094324

Keywords

Search

Navigation