Survivable networks, linear programming relaxations and the parsimonious property (Q689117)

From MaRDI portal
Revision as of 11:32, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Survivable networks, linear programming relaxations and the parsimonious property
scientific article

    Statements

    Survivable networks, linear programming relaxations and the parsimonious property (English)
    0 references
    0 references
    0 references
    0 references
    6 December 1993
    0 references
    0 references
    worst-case analysis
    0 references
    heuristics
    0 references
    survivable network design
    0 references
    edge- connectivity requirements
    0 references
    Steiner tree
    0 references
    traveling salesman
    0 references
    \(k\)-edge- connected network design
    0 references
    parsimonious property
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references