Symmetric weight constrained traveling salesman problem: Local search
type: Item
instance of: scholarly article
title: Symmetric weight constrained traveling salesman problem: Local search
zbMATH Open document ID: 1211.90261
author: Dharmananda Gahir
author: Prabha Sharma
published in: Opsearch
publication date: 2011-05-13T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5887828
zbMATH Keywords: local search heuristic
zbMATH Keywords: 1-tree lower bound
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: subsgradient maximization
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s12597-010-0028-8
OpenAlex ID: W2072095633
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Validation of subgradient optimization
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: TSP heuristics: domination analysis and complexity
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: TSPLIB—A Traveling Salesman Problem Library
DOI: 10.1007/S12597-010-0028-8
description: scientific article; zbMATH DE number 5887828