A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows (Q2892314): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPTW / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2153565255 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:43, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows |
scientific article |
Statements
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows (English)
0 references
18 June 2012
0 references
traveling salesman
0 references
time windows
0 references
simulated annealing
0 references
penalty methods
0 references
