The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms (Q5434593)

From MaRDI portal
Revision as of 11:43, 24 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5223729
Language Label Description Also known as
English
The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
scientific article; zbMATH DE number 5223729

    Statements

    The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms (English)
    0 references
    0 references
    7 January 2008
    0 references
    traveling salesman
    0 references
    pickup-and-delivery
    0 references
    branch-and-cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references