An improved lower bound for the traveling salesman constant

DOI10.1016/J.ORL.2019.11.007OpenAlexW2996602723WikidataQ126620020 ScholiaQ126620020MaRDI QIDQ2294531FDOQ2294531

Patrick Jaillet, Julia Gaudio

Publication date: 11 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

traveling salesman problemgeometric probabilityEuclidean combinatorial optimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• The Traveling-Salesman Problem and Minimum Spanning Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
• New Bounds for the Traveling Salesman Constant

Cited In (6)

• An Improved Lower Bound for the Traveling Salesman Constant
• New Bounds for the Traveling Salesman Constant
• A new lower bound for the geometric traveling salesman problem in terms of discrepancy
• Continuous approximation formulas for location problems
• Tight lower bounds for the traveling salesman problem with draft limits
• Title not available (Why is that?)

This page was built for publication: An improved lower bound for the traveling salesman constant

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