Two exact algorithms for the distance-constrained vehicle routing problem (Q3325496): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230140113 / 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: Q4404428 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integer programming approaches to the travelling salesman problem / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230140113 / rank | |||
Normal rank | |||
Latest revision as of 02:16, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two exact algorithms for the distance-constrained vehicle routing problem |
scientific article |
Statements
Two exact algorithms for the distance-constrained vehicle routing problem (English)
0 references
1984
0 references
computational results
0 references
vehicle routing
0 references
multiple traveling salesman
0 references
exact algorithms
0 references
cutting plane method
0 references
branch and bound method
0 references
