Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683)

From MaRDI portal
Revision as of 11:21, 13 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
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
scientific article

    Statements

    Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    exact algorithms
    0 references
    vehicle routing
    0 references
    spanning tree
    0 references
    shortest path relaxations
    0 references
    central facility
    0 references
    known demands
    0 references
    multiple travelling salesman
    0 references
    tree search algorithms
    0 references
    computational results
    0 references
    Lagrangean relaxation
    0 references
    minimization of total distance travelled
    0 references

    Identifiers

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