An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125)
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 4131981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem |
scientific article; zbMATH DE number 4131981 |
Statements
An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (English)
0 references
1990
0 references
traveling salesman
0 references
0.8219008445739746
0 references
0.8202624917030334
0 references
0.8137734532356262
0 references
0.7973014712333679
0 references
0.7954826354980469
0 references
