Analysis of heuristics for the design of tree networks

DOI10.1007/BF02094324zbMath0762.90081MaRDI QIDQ1197773

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

Publication date: 16 January 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

capacitated minimum spanning treetour partitioning heuristicsworst- case performance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

The \((K, k)\)-capacitated spanning tree problem, Topological design of telecommunication networks --- local access design methods

Cites Work

• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• The complexity of the capacitated tree problem
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems