SFX by Ex Libris Inc.

Title:	The Parameterized Complexity of Local Search for TSP, More Refined
Source:	Algorithmica [0178-4617] Guo, Jiong yr:2012

Basic

Full text

Full text available via SpringerLINK Contemporary 1997-Present

Year:

Volume:

Issue:

Start Page:

Document delivery

Request document via Library/Bibliothek

Users interested in this article also expressed an interest in the following:
description	1.	Safra, S. "On the complexity of approximating tsp with neighborhoods and related problems." Computational complexity 14.4 (2006): 281-307.
description	2.	Wiener, J. "Planning paths to multiple targets: Memory involvement and planning heuristics in spatial problem solving." Psychological Research 73.5 (2009): 644-658.
description	3.	Deineko, Vladimir G. "Four-point conditions for the TSP: The complete complexity classification." Discrete optimization 14 (2014): 147-159.
description	4.	Punnen, A. "TSP heuristics: Domination analysis and complexity." Algorithmica 35.2 (2003): 111-127.
description	5.	Vickers, D. "Human performance on visually presented Traveling Salesman problems." Psychological research 65.1 (2001): 34-45.
description	6.	"Fine-grained Complexity Analysis of Two Classic TSP Variants." ACM transactions on algorithms : TALG. 17.1: 1-29.
description	7.	Alemayehu, J. "Efficient Nearest Neighbor Heuristic TSP Algorithms for Reducing Data Acquisition Latency of UAV Relay WSN." Wireless Personal Communications 95.3 (2017): 1-15.
description	8.	Köhler, S. "Self-stabilizing local k-placement of replicas with local minimum variance." Theoretical computer science (2015): 15-27.
description	9.	Hoos, H. "On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances." Optimization Letters 9.6 (2015): 1247-1254.
description	10.	Eswarawaka, R. "Genetic annealing with efficient strategies to improve the performance for the NP-hard and routing problems." Journal of experimental and theoretical artificial intelligence 27.6 (2015): 779-788.
description	11.	Niendorf, M. "Stability of Solutions to Classes of Traveling Salesman Problems." IEEE Transactions on Cybernetics 46.4 (2015): 1-1.
description	12.	Baldwin, Carryl L. "Individual Differences in Route-Learning Strategy and Associated Working Memory Resources." Human Factors 51.3 (2009): 368-377.
description	13.	Fantino, Edmund, E. "Rules and problem solving: Another look." The American journal of psychology 116.4 (2003): 613-632.
description	14.	Garling, T. "The role of cognitive maps in spatial decisions." Journal of environmental psychology 9.4 (1989): 269-278.
description	15.	Hahsler, M.. "TSP - Infrastructure for the traveling salesperson problem." Journal of statistical software 23.2 (2007): 1-21.
description	16.	Vickers, D. "Intelligence and individual differences in performance on three types of visually presented optimisation problems." Personality and Individual Differences 36.5 (2004): 1059-1071.
description	17.	Vickers, D. "Are Individual Differences in Performance on Perceptual and Cognitive Optimization Problems Determined by General Intelligence?" The Journal of problem solving 1.1 (2006): 3-19.
description	18.	MacGregor, James N. "Human Performance on the Traveling Salesman and Related Problems: A Review." The Journal of problem solving 3.2 (2011): 1-29.
description	19.	MacGregor, J N N. "Spatial and contextual factors in human performance on the travelling salesperson problem." Perception 28.11 (1999): 1417-27.
description	20.	"Analyzing the Effects of Instance Features and Algorithm Parameters for Max–Min Ant System and the Traveling Salesperson Problem." Frontiers in Robotics and AI. 2.