Topological design of telecommunication networks --- local access design methods (Q1179728): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Problem / 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: Topological design of computer communication networks -- the overall design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of heuristics for the design of tree networks / 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: A New Class of Algorithms for Multipoint Network Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centralized teleprocessing network design / 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: Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds / 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: Efficient algorithms for the capacitated concentrator location 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: The One-Terminal TELPAK Problem / rank
 
Normal rank

Latest revision as of 12:49, 15 May 2024

scientific article
Language Label Description Also known as
English
Topological design of telecommunication networks --- local access design methods
scientific article

    Statements

    Topological design of telecommunication networks --- local access design methods (English)
    0 references
    0 references
    27 June 1992
    0 references
    telecommunication systems
    0 references
    local access network
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references