Designing tributary networks with multiple ring families. (Q1406732): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(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: Design of stacked self-healing rings using a genetic algorithm / 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: Design of local networks using USHRs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering for the Design of SONET Rings in Interoffice Telecommunications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Load Balancing on Sonet Bidirectional Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for designing rings for survivable fiber networks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(98)00005-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078831408 / rank
 
Normal rank

Latest revision as of 11:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Designing tributary networks with multiple ring families.
scientific article

    Statements

    Designing tributary networks with multiple ring families. (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2003
    0 references
    0 references
    Network design
    0 references
    telecommunications networks
    0 references
    routing
    0 references
    combinatorial
    0 references
    heuristics
    0 references
    0 references