On the stochastic complexity of the asymmetric traveling salesman problem (Q915656)

From MaRDI portal
Revision as of 09:33, 21 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
On the stochastic complexity of the asymmetric traveling salesman problem
scientific article

    Statements

    On the stochastic complexity of the asymmetric traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    polynomial bound
    0 references
    combinatorial analysis
    0 references
    discrete optimization
    0 references
    stochastic complexity
    0 references
    asymmetric traveling salesman
    0 references
    0 references