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
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331934.2013.824445 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021842356 / rank | |||
Normal rank | |||
Revision as of 02:13, 20 March 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
