A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal expansion of capacitated transshipment networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Algorithm for Multi-Level Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for planning capacity expansion in local access telecommunication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning / 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: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the local access telecommunication network expansion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of telecommunication networks --- local access design methods / 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: Dynamic programming based heuristics for the topological design of local access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the uncapacitated network design polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Implementation of an Interactive Optimization System for Telephone Network Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating concentrators in centralized computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A suboptimal solution to a hierarchical network design problem using dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for capacity expansion of local access networks / rank
 
Normal rank

Revision as of 11:07, 3 June 2024

scientific article
Language Label Description Also known as
English
A dynamic programming algorithm for the local access telecommunication network expansion problem
scientific article

    Statements

    A dynamic programming algorithm for the local access telecommunication network expansion problem (English)
    0 references
    21 December 2000
    0 references
    dynamic programming
    0 references
    telecommunication networks
    0 references

    Identifiers