Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
From MaRDI portal
Publication:3643507
DOI10.1051/cocv:2008056zbMath1189.90127WikidataQ110085077 ScholiaQ110085077MaRDI QIDQ3643507
Tuomo Valkonen, Tommi Kärkkäinen
Publication date: 9 November 2009
Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/246063
90C26: Nonconvex programming, global optimization
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Extension of primal-dual interior point methods to diff-convex problems on symmetric cones, Clustering and the perturbed spatial median, Refined optimality conditions for differences of convex functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of traveling salesman problems
- Handbook of global optimization
- Approximation schemes for NP-hard geometric optimization problems: a survey
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
- Quantitative Stability of Variational Systems: I. The Epigraphical Distance
- TSPLIB—A Traveling Salesman Problem Library
- Fast Algorithms for Geometric Traveling Salesman Problems
- Variational Analysis
- Quantitative Stability of Variational Systems II. A Framework for Nonlinear Conditioning
- The Lazy Travelling Salesman Problem in $\mathbb{R}^2$
- Convex Analysis
- Analytic Inequalities
