A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation (Q3875702)

From MaRDI portal
Revision as of 18:45, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
scientific article

    Statements

    A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation (English)
    0 references
    0 references
    1980
    0 references
    asymmetric travelling salesman problem
    0 references
    one-arborescence relaxation
    0 references
    LIFO implicit enumeration algorithm
    0 references
    comparison of algorithms
    0 references
    algorithmic performance analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references