New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675): Difference between revisions
From MaRDI portal
Latest revision as of 08:51, 7 July 2024
scientific article; zbMATH DE number 6256368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times |
scientific article; zbMATH DE number 6256368 |
Statements
New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (English)
0 references
7 February 2014
0 references
traveling salesman problem
0 references
integer programming
0 references
tour duration
0 references
0 references
0 references
0 references
0 references
