Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
From MaRDI portal
Publication:4008469
DOI10.1080/02522667.1992.10699092zbMath0763.90042OpenAlexW1987494379MaRDI QIDQ4008469
Kemal Altinkemer, Hasan Pirkul
Publication date: 27 September 1992
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1992.10699092
computer communication networkssubtreehierarchical networksmultiple center capacitated minimum spanning treesink nodesweighted source nodes
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items
Cites Work
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Complexity of spanning tree problems: Part I
- On the complexity of finding multi-constrained spanning trees
- Centralized teleprocessing network design
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Bounds and Heuristics for Capacitated Routing Problems
- Heuristics with Constant Error Guarantees for the Design of Tree Networks
- Topological design of centralized computer networks—formulations and algorithms
- Parallel Savings Based Heuristics for the Delivery Problem
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Large-Scale Network Topological Optimization
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- The Capacitated Minimum Spanning Tree
