Continuous relaxations for the traveling salesman problem (Q2296989): Difference between revisions

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

Latest revision as of 20:18, 21 July 2024

scientific article
Language Label Description Also known as
English
Continuous relaxations for the traveling salesman problem
scientific article

    Statements

    Continuous relaxations for the traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 February 2020
    0 references
    0 references
    traveling salesman problem
    0 references
    dynamical systems for optimization
    0 references
    procrustes solution
    0 references
    stable manifolds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references