A comparison of techniques for solving the fleet size and mix vehicle routing problem (Q800225): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A comparison of techniques for solving the fleet size and mix vehicle routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The fleet size and mix vehicle routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate Traveling Salesman Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implementing vehicle routing algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Lagrangean relaxation heuristic for vehicle routing / rank | |||
Normal rank | |||
Revision as of 14:56, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of techniques for solving the fleet size and mix vehicle routing problem |
scientific article |
Statements
A comparison of techniques for solving the fleet size and mix vehicle routing problem (English)
0 references
1984
0 references
fleet size
0 references
mix vehicle routing
0 references
heuristics
0 references
lower bound procedure
0 references
Computational results
0 references
