A new subtour elimination constraint for the vehicle routing problem (Q1278251): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Integer linear programming formulation for a vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set‐partitioning‐based exact algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the asymmetrical capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Routing under Capacity and Distance Restrictions / rank
 
Normal rank

Latest revision as of 18:30, 28 May 2024

scientific article
Language Label Description Also known as
English
A new subtour elimination constraint for the vehicle routing problem
scientific article

    Statements

    A new subtour elimination constraint for the vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    vehicle routing
    0 references
    0 references
    0 references
    0 references