Using global search heuristics for the capacity vehicle routing problem. (Q1406639): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization by Simulated Annealing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Distance Constrained Vehicle Routing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3525910 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4495496 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank | |||
Normal rank |
Revision as of 10:38, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Using global search heuristics for the capacity vehicle routing problem. |
scientific article |
Statements
Using global search heuristics for the capacity vehicle routing problem. (English)
0 references
7 September 2003
0 references