Multiple stack branch and bound (Q922704)

From MaRDI portal
Revision as of 11:56, 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
Multiple stack branch and bound
scientific article

    Statements

    Multiple stack branch and bound (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    design of algorithms
    0 references
    tree search
    0 references
    approximation algorithm
    0 references
    branch and bound
    0 references
    Euclidean traveling salesman problem
    0 references