A compressed-annealing heuristic for the traveling salesman problem with time windows (Q2892314)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A compressed-annealing heuristic for the traveling salesman problem with time windows |
scientific article; zbMATH DE number 6047431
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A compressed-annealing heuristic for the traveling salesman problem with time windows |
scientific article; zbMATH DE number 6047431 |
Statements
18 June 2012
0 references
traveling salesman
0 references
time windows
0 references
simulated annealing
0 references
penalty methods
0 references
A compressed-annealing heuristic for the traveling salesman problem with time windows (English)
0 references
