Symmetric weight constrained traveling salesman problem: Local search

DOI10.1007/s12597-010-0028-8zbMath1211.90261OpenAlexW2072095633MaRDI QIDQ535615

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

Lagrangian relaxationlocal search heuristic1-tree lower boundsubsgradient maximization

Mathematics Subject Classification ID

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

Uses Software

• TSPLIB

Cites Work

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

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