Dynamic programming based heuristics for the topological design of local access networks (Q1179743): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: The Capacitated Minimum Spanning Tree / 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: A New Class of Algorithms for Multipoint Network Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the capacitated tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5622261 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:50, 15 May 2024

scientific article
Language Label Description Also known as
English
Dynamic programming based heuristics for the topological design of local access networks
scientific article

    Statements

    Dynamic programming based heuristics for the topological design of local access networks (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    terminal layout problem
    0 references
    data communication network design
    0 references
    minimal spanning tree
    0 references
    additional constraint
    0 references
    clustering
    0 references
    decomposition
    0 references
    heuristic
    0 references