Models for planning capacity expansion in local access telecommunication networks (Q806810): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering a tree by subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the optimal network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Network Topological Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Minimum Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristics and relaxations for the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate algorithms for optimal network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Location in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion / 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: Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Approach to the Selection of an Optimal Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centralized teleprocessing network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and facets of the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The telephonic switching centre network problem: Formalization and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Modernization Policies for Telecommunications Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications / 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: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for capacity expansion of local access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals / rank
 
Normal rank

Latest revision as of 16:58, 21 June 2024

scientific article
Language Label Description Also known as
English
Models for planning capacity expansion in local access telecommunication networks
scientific article

    Statements

    Models for planning capacity expansion in local access telecommunication networks (English)
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references

    Identifiers