A two-phase algorithm for the partial accessibility constrained vehicle routing problem (Q1908293): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993418 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving real-life vehicle routing problems efficiently using tabu search / rank | |||
Normal rank |
Latest revision as of 09:54, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A two-phase algorithm for the partial accessibility constrained vehicle routing problem |
scientific article |
Statements
A two-phase algorithm for the partial accessibility constrained vehicle routing problem (English)
0 references
15 September 1996
0 references
Lagrangian relaxation
0 references
partial accessibility constrained vehicle routing
0 references
two-phase heuristic
0 references
0 references