Truncated \(M\)-travelling salesman problem (Q998696)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5504565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Truncated \(M\)-travelling salesman problem |
scientific article; zbMATH DE number 5504565 |
Statements
Truncated \(M\)-travelling salesman problem (English)
0 references
9 February 2009
0 references
truncated \(M\)-travelling salesmen problem
0 references
lexi-search algorithm
0 references
pattern recognition technique
0 references
trip-schedule
0 references
ordered pairs
0 references
alphabet-table
0 references
word
0 references
search table
0 references
0.8846546
0 references
0 references
0.8811652
0 references
0.8781343
0 references
0 references
0.87533796
0 references
