Proposed theoretical value for TSP constant

DOI10.1142/S1793830924300017MaRDI QIDQ6983321zbMATH OpenFDO

Authors L. D. den Boer

Publication date 15 May 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1142/S1793830924300017

zbMATH Keywords

beta-TSPcombinatorial optimizationtraveling salesman problemTSPTSP constant

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A Lower Bound for the Expected Travel Among m Random Points
• Computer Solutions of the Traveling Salesman Problem
• Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
• Guesstimation. Solving the world's problems on the back of a cocktail napkin
• scientific article; zbMATH DE number 871931 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Numerical recipes. The art of scientific computing.
• The traveling salesman problem. A computational study.

This page was built for publication: Proposed theoretical value for TSP constant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983321)