On the stochastic complexity of the asymmetric traveling salesman problem (Q915656)
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 4152157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the stochastic complexity of the asymmetric traveling salesman problem |
scientific article; zbMATH DE number 4152157 |
Statements
On the stochastic complexity of the asymmetric traveling salesman problem (English)
0 references
1989
0 references
polynomial bound
0 references
combinatorial analysis
0 references
discrete optimization
0 references
stochastic complexity
0 references
asymmetric traveling salesman
0 references
0 references
0 references
0 references
0.8246629238128662
0 references
0.7916978001594543
0 references
0.7875286340713501
0 references
0.7760871648788452
0 references
