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

DOI10.1134/S0005117918070093zbMath1490.90248OpenAlexW4253739322MaRDI QIDQ1792597

M. I. Fomichev, G. N. Zhukova, V. A. Goloveshkin, M. V. Ulyanov

Publication date: 12 October 2018

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117918070093

zbMATH Keywords

traveling salesman problemprobabilistic predictionapproximations of probability distributionscomplexity of an individual traveling salesman problemquantile kurtosisquantile skewness

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear resolving functions for the travelling salesman problem
• The symmetric travelling salesman problem. II: New low bounds
• Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
• Early Estimates of the Size of Branch-and-Bound Trees
• Estimating the Efficiency of Backtrack Programs
• Tree Size by Partial Backtracking
• Characterizing systems of distributions by quantile measures
• An Algorithm for the Traveling Salesman Problem