The traveling salesman problem on a graph and some related integer polyhedra (Q3675933)

From MaRDI portal
Revision as of 05:53, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q96162135, #quickstatements; #temporary_batch_1712286835472)
scientific article
Language Label Description Also known as
English
The traveling salesman problem on a graph and some related integer polyhedra
scientific article

    Statements

    The traveling salesman problem on a graph and some related integer polyhedra (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    graphical traveling Salesman
    0 references
    minimum length cycle
    0 references
    facet
    0 references
    comb inequalities
    0 references
    integer polyhedra
    0 references
    efficient algorithm
    0 references
    Steiner tree
    0 references
    polynomial algorithm
    0 references
    series-parallel graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references