New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638)

From MaRDI portal
Revision as of 02:41, 4 July 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
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
scientific article

    Statements

    New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2011
    0 references
    0 references
    high multiplicity asymmetric traveling salesman problem
    0 references
    polynomial-length formulation
    0 references
    Chesapeake problem
    0 references
    parallel machine scheduling
    0 references
    lot-sizing
    0 references
    0 references