An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622)

From MaRDI portal
Revision as of 09:06, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1968015
Language Label Description Also known as
English
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
scientific article; zbMATH DE number 1968015

    Statements

    An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2003
    0 references
    traveling salesman problem
    0 references
    delivery and collection
    0 references
    valid inequalities
    0 references
    branch and cut
    0 references
    0 references
    0 references

    Identifiers

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