An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344)

From MaRDI portal
Revision as of 15:04, 15 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
An additive bounding procedure for the asymmetric travelling salesman problem
scientific article

    Statements

    An additive bounding procedure for the asymmetric travelling salesman problem (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    lower bounds
    0 references
    asymmetric travelling salesman
    0 references
    spanning arborescences
    0 references
    branch and bound
    0 references

    Identifiers