Symmetric weight constrained traveling salesman problem: Local search

DOI10.1007/S12597-010-0028-8MaRDI QIDQ535615zbMATH OpenOpenAlexFDO

Authors Dharmananda Gahir, Prabha Sharma

Publication date 13 May 2011

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-010-0028-8

zbMATH Keywords

1-tree lower boundLagrangian relaxationlocal search heuristicsubsgradient maximization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The symmetric clustered traveling salesman problem
• Sequential and parallel local search for the time-constrained traveling salesman problem
• Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
• New lower bounds for the symmetric travelling salesman problem
• scientific article; zbMATH DE number 1003245

Cites work

• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The traveling salesman. Computational solutions for RSP applications
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• TSP heuristics: domination analysis and complexity
• TSPLIB—A Traveling Salesman Problem Library
• Validation of subgradient optimization

Cited in

(2)

• Weakly symmetric graphs, elementary landscapes, and the TSP
• Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Symmetric weight constrained traveling salesman problem: Local search

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