Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data (Q1792597)
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: Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data |
scientific article; zbMATH DE number 6952684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data |
scientific article; zbMATH DE number 6952684 |
Statements
Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data (English)
0 references
12 October 2018
0 references
traveling salesman problem
0 references
complexity of an individual traveling salesman problem
0 references
approximations of probability distributions
0 references
quantile skewness
0 references
quantile kurtosis
0 references
probabilistic prediction
0 references
0 references
0.7916978001594543
0 references
0.7693806290626526
0 references
0.755660355091095
0 references
0.7487354278564453
0 references
