Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data (Q1792597)

From MaRDI portal
Revision as of 09:34, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data
scientific article

    Statements

    Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data (English)
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers