A new lower bound for the geometric traveling salesman problem in terms of discrepancy

DOI10.1016/J.ORL.2010.03.007zbMATH Open1193.90181OpenAlexW1997786488MaRDI QIDQ991472FDOQ991472

Authors: Stefan Steinerberger 

Publication date: 7 September 2010

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

Full work available at URL: https://doi.org/10.1016/j.orl.2010.03.007

Recommendations

• New lower bounds for the symmetric travelling salesman problem
• A Lower Bound for Adjacencies on the Traveling Salesman Polytope
• An improved lower bound for the traveling salesman constant
• An improved assignment lower bound for the Euclidean traveling salesman problem
• Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
• New Bounds for the Traveling Salesman Constant
• Better assignment lower bounds for the Euclidean traveling salesman problem
• A novel discretization scheme for the close enough traveling salesman problem
• Estimating the Held-Karp lower bound for the geometric TSP
• Algorithms for solution of the travelling salesman problem. II: New lower bound

zbMATH Keywords

uniform distributiondiscrepancytraveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Sequences, discrepancies and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Shortest Paths Through Pseudo-Random Points in the d-Cube

Cited In (4)

• Bounds for the traveling salesman paths of two-dimensional modular lattices
• Randomized near-neighbor graphs, giant components and applications in data science
• Random restricted matching and lower bounds for combinatorial optimization
• Estimating the Held-Karp lower bound for the geometric TSP

This page was built for publication: A new lower bound for the geometric traveling salesman problem in terms of discrepancy

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