An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2017.06.026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2733776472 / rank | |||
Normal rank | |||
Revision as of 20:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An integer programming approach for the time-dependent traveling salesman problem with time windows |
scientific article |
Statements
An integer programming approach for the time-dependent traveling salesman problem with time windows (English)
0 references
12 July 2018
0 references
time-dependent TSP
0 references
time windows
0 references
integer linear programming
0 references
branch-and-cut
0 references
