A branch-and-cut algorithm for the orienteering arc routing problem (Q342166)

From MaRDI portal
Revision as of 23:57, 12 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
A branch-and-cut algorithm for the orienteering arc routing problem
scientific article

    Statements

    A branch-and-cut algorithm for the orienteering arc routing problem (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    orienteering arc routing problem
    0 references
    routing problems with profits
    0 references
    branch-and-cut
    0 references
    0 references