Continuous relaxations for the traveling salesman problem

DOI10.1007/s11071-019-05092-5zbMath1430.37126arXiv1702.05224OpenAlexW3105081266WikidataQ127498502 ScholiaQ127498502MaRDI QIDQ2296989

Adrian Ziessler, Michael Dellnitz, Stefan Klus, Tuhin Sahai

Publication date: 18 February 2020

Published in: Nonlinear Dynamics (Search for Journal in Brave)

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

zbMATH Keywords

traveling salesman problemstable manifoldsdynamical systems for optimizationprocrustes solution

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamical systems in optimization and economics (37N40)

Related Items (1)

Dynamical Systems Theory and Algorithms for NP-hard Problems

Uses Software

• ScaLAPACK
• TSPLIB
• GAIO
• LKH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
• A feasible method for optimization with orthogonality constraints
• Hearing the clusters of a graph: A distributed algorithm
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Least squares matching problems
• On the solution of traveling salesman problems
• A subdivision algorithm for the computation of unstable manifolds and global attractors
• SONET/SDH ring assignment with capacity constraints
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Matrix representation and gradient flows for NP-hard problems
• Worst-case analysis of a new heuristic for the travelling salesman problem
• A dynamical systems approach to weighted graph matching
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• On Lagrangian Relaxation of Quadratic Matrix Constraints
• A Set-Oriented Numerical Approach for Dynamical Systems with Parameter Uncertainty
• Assignment Problems and the Location of Economic Activities
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Reducibility Among Combinatorial Problems
• Computing the Polar Decomposition—with Applications
• Accelerated branch exchange heuristics for symmetric traveling salesman problems
• TSPLIB—A Traveling Salesman Problem Library
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• The Geometry of Algorithms with Orthogonality Constraints
• ScaLAPACK Users' Guide
• Procrustes Problems
• A variational perspective on accelerated methods in optimization
• Regularity of embeddings of infinite-dimensional fractal sets into finite-dimensional spaces
• Optimal control of plotting and drilling machines: A case study
• The Numerical Computation of Unstable Manifolds for Infinite Dimensional Dynamical Systems by Embedding Techniques
• A spectral assignment approach for the graph isomorphism problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Continuous relaxations for the traveling salesman problem