Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
TSP Heuristics: Domination Analysis and Complexity
Home
Publications
TSP Heuristics: Domination Analysis and Complexity
TSP Heuristics: Domination Analysis and Complexity
Authors:
PU
Punnen
Punnen
MA
Margot
Margot
KA
Kabadi
Kabadi
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 February 2003
journal article
research article
Published by
Springer Nature
in
Algorithmica
Vol. 35
(2)
,
111-127
DOI:
10.1007/s00453-002-0986-1
Abstract
No abstract available
Keywords
DOMINATION ANALYSIS, APPROXIMATION ALGORITHMS, TRAVELING SALESMAN PROBLEM, COMPUTATIONAL COMPLEXITY.
Cited
Cited by 41 articles
Scroll to top