Euclidean Traveling Salesman Tours through Stochastic Neighborhoods

DOI10.1007/978-3-642-45030-3_60zbMATH Open1408.90255OpenAlexW1929115470MaRDI QIDQ2872129FDOQ2872129

Authors: Pegah Kamousi, Subhash Suri 

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_60

Recommendations

• APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
• scientific article; zbMATH DE number 747044
• Probabilistic exchange algorithms and Euclidean traveling salesman problems
• Heuristics for the stochastic Eulerian tour problem
• On the Stochastic Euclidean Travelling Salesperson Problem for Distributions with Unbounded Support
• The Traveling Salesman Location Problem on Stochastic Networks
• Publication:3479820
• Random tours in the traveling salesman problem: Analysis and application
• The traveling salesman problem under squared Euclidean distances
• Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stochastic programming (90C15) Approximation algorithms (68W25) Computer system organization (68M99)

Cited In (4)

• Constant-Factor Approximation for TSP with Disks
• Euclidean travelling salesman problem with location-dependent and power-weighted edges
• Not all insertion methods yield constant approximate tours in the Euclidean plane
• Ordered spatial sampling by means of the traveling salesman problem

This page was built for publication: Euclidean Traveling Salesman Tours through Stochastic Neighborhoods

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