Topological optimization with a network reliability constraint (Q5954244): 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: Design of reliable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological optimization of a communication network subject to a reliability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability optimization of computer-communication networks / 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: Q4086956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable communications networks under performance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Indices for Topological Design of Computer Communication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747697 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:35, 3 June 2024

scientific article; zbMATH DE number 1699133
Language Label Description Also known as
English
Topological optimization with a network reliability constraint
scientific article; zbMATH DE number 1699133

    Statements

    Topological optimization with a network reliability constraint (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    network design
    0 references
    optimization
    0 references
    network reliability
    0 references
    branch-and-bound method
    0 references
    upper bound
    0 references