Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem (Q4008469): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02522667.1992.10699092 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987494379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Savings Based Heuristics for the Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for unequal weight delivery problems with a fixed error guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics with Constant Error Guarantees for the Design of Tree Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Network Topological Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of spanning tree problems: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding multi-constrained spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Minimum Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of centralized computer networks—formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Heuristics for Capacitated Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centralized teleprocessing network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:49, 16 May 2024

scientific article
Language Label Description Also known as
English
Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
scientific article

    Statements

    Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem (English)
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multiple center capacitated minimum spanning tree
    0 references
    weighted source nodes
    0 references
    sink nodes
    0 references
    subtree
    0 references
    computer communication networks
    0 references
    hierarchical networks
    0 references
    0 references