A bootstrap heuristic for designing minimum cost survivable networks (Q1919975): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: XMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum augmentation of a tree to a K-edge-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum augmentation of a directed tree to ak-edge-connected directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greek Astronomy and its Debt to the Babylonians / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bootstrap heuristic for designing minimum cost survivable 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: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank

Latest revision as of 12:45, 24 May 2024

scientific article
Language Label Description Also known as
English
A bootstrap heuristic for designing minimum cost survivable networks
scientific article

    Statements

    A bootstrap heuristic for designing minimum cost survivable networks (English)
    0 references
    0 references
    0 references
    30 October 1996
    0 references
    minimum cost survivable networks
    0 references
    heuristics
    0 references
    design system
    0 references
    0 references
    0 references

    Identifiers