A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522)
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 hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection |
scientific article; zbMATH DE number 6901538
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection |
scientific article; zbMATH DE number 6901538 |
Statements
A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (English)
0 references
11 July 2018
0 references
dynamic programming
0 references
traveling salesman problem
0 references
infeasible local search
0 references
0 references
0 references
0 references
