New Bounds for the Traveling Salesman Constant

DOI10.1239/aap/1427814579zbMath1309.60005arXiv1311.6338OpenAlexW2963958826WikidataQ63198871 ScholiaQ63198871MaRDI QIDQ5246169

Stefan Steinerberger

Publication date: 17 April 2015

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.6338

zbMATH Keywords

Beardwood-Halton-Hammersley theoremtraveling salesman constant

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Functional limit theorems; invariance principles (60F17)

Related Items (10)

Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction ⋮ Euclidean travelling salesman problem with location-dependent and power-weighted edges ⋮ On global integer extrema of real-valued box-constrained multivariate quadratic functions ⋮ Iterated tour partitioning for Euclidean capacitated vehicle routing ⋮ Continuous approximation formulas for location problems ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ Randomized near-neighbor graphs, giant components and applications in data science ⋮ Bounds for the traveling salesman paths of two-dimensional modular lattices ⋮ Traveling salesman problem across well-connected cities and with location-dependent edge lengths ⋮ An improved lower bound for the traveling salesman constant

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
• Estimating the Held-Karp lower bound for the geometric TSP
• Limit theorems and rates of convergence for Euclidean functionals
• The traveling salesman problem and its variations
• Über einen geometrischen Satz
• The shortest path and the shortest road through n points
• Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
• On the Shortest Path Through a Number of Points
• In Pursuit of the Traveling Salesman

This page was built for publication: New Bounds for the Traveling Salesman Constant