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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3205014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank

Latest revision as of 11:21, 13 June 2024

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