The 2-edge-connected subgraph polyhedron (Q2576774)

From MaRDI portal
Revision as of 14:13, 11 June 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
The 2-edge-connected subgraph polyhedron
scientific article

    Statements

    The 2-edge-connected subgraph polyhedron (English)
    0 references
    14 December 2005
    0 references
    0 references
    network design
    0 references
    edge-connectivity
    0 references
    traveling salesman problem
    0 references
    polyhedra
    0 references
    0 references
    0 references
    0 references