The dynamic programming method in the generalized traveling salesman problem (Q1362222)
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: The dynamic programming method in the generalized traveling salesman problem |
scientific article; zbMATH DE number 1042734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The dynamic programming method in the generalized traveling salesman problem |
scientific article; zbMATH DE number 1042734 |
Statements
The dynamic programming method in the generalized traveling salesman problem (English)
0 references
3 August 1997
0 references
discrete-continuous problem
0 references
route optimization
0 references
taveling salesman
0 references
bottleneck
0 references
0.8372299075126648
0 references
0.8253141045570374
0 references
0.8113763928413391
0 references
0.8022528290748596
0 references
0.7999448776245117
0 references
