People Efficiently Explore the Solution Space of the Computationally Intractable Traveling Salesman Problem to Find Near-Optimal Tours
暂无分享,去创建一个
[1] M. Hagen,et al. Ethical principles of psychologists and code of conduct. , 2002, The American psychologist.
[2] D Vickers,et al. The importance of the convex hull for human performance on the traveling salesman problem: A comment on MacGregor and Ormerod (1996) , 2000, Perception & psychophysics.
[3] Yll Haxhimusa,et al. Approximative graph pyramid solution of the E-TSP , 2009, Image Vis. Comput..
[4] John R. Anderson. The Architecture of Cognition , 1983 .
[5] T. Ormerod,et al. Convex hull or crossing avoidance? Solution heuristics in the traveling salesperson problem , 2004, Memory & cognition.
[6] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[7] J. Tenenbaum,et al. Theory-based Bayesian models of inductive learning and reasoning , 2006, Trends in Cognitive Sciences.
[8] Alan Agresti,et al. Categorical Data Analysis , 2003 .
[9] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[10] R. Bellman. COMBINATORIAL PROCESSES AND DYNAMIC PROGRAMMING , 1958 .
[11] J. M. Singer,et al. Searching for backbones — an efficient parallel algorithm for the traveling salesman problem , 1996 .
[12] M. Lee,et al. The aesthetic appeal of minimal structures: Judging the attractiveness of solutions to traveling salesperson problems , 2006, Perception & psychophysics.
[13] Susanne Tak,et al. Some Tours are More Equal than Others: The Convex-Hull Model Revisited with Lessons for Testing Models of the Traveling Salesperson Problem , 2008, J. Probl. Solving.
[14] Shang-Hua Teng,et al. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.
[15] Assaf Naor,et al. Rigorous location of phase transitions in hard optimization problems , 2005, Nature.
[16] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[17] Rajesh P. N. Rao,et al. Bayesian brain : probabilistic approaches to neural coding , 2006 .
[18] Yll Haxhimusa,et al. Traveling Salesman Problem: A Foveating Pyramid Model , 2006, J. Probl. Solving.
[19] Weixiong Zhang,et al. Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem , 2011, J. Artif. Intell. Res..
[20] Richard Durbin,et al. An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.
[21] Bart Selman,et al. On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search , 2003 .
[22] Lester E. Krueger,et al. Analyzing vision at the complexity level: Misplaced complexity? , 1990, Behavioral and Brain Sciences.
[23] Bart Selman,et al. Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.
[24] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[25] T. Ormerod,et al. Human performance on the traveling salesman problem , 1996, Perception & psychophysics.
[26] A. Joshi,et al. The traveling salesman problem: A hierarchical model , 2000, Memory & cognition.
[27] Ivan Serina,et al. LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.
[28] Scott Kirkpatrick,et al. Optimization by Simmulated Annealing , 1983, Sci..
[29] R. Agarwala,et al. A fast and scalable radiation hybrid map construction and integration strategy. , 2000, Genome research.
[30] Daniel A. Braun,et al. Structure learning in action , 2010, Behavioural Brain Research.
[31] T. Ormerod,et al. Global perceptual processing in problem solving: The case of the traveling salesperson , 1999, Perception & psychophysics.
[32] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[33] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[34] Patrick D. Krolak,et al. A man-machine approach toward solving the traveling salesman problem , 1970, CACM.
[35] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[36] Paul R. Schrater,et al. Structure Learning in Human Sequential Decision-Making , 2008, NIPS.
[37] John R. Anderson. How Can the Human Mind Occur in the Physical Universe , 2007 .
[38] J. Emlen. The Role of Time and Energy in Food Preference , 1966, The American Naturalist.
[39] P. Taylor,et al. Test of optimal sampling by foraging great tits , 1978 .
[40] Weixiong Zhang,et al. A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones , 2005, IJCAI.
[41] Bart Selman,et al. Problem Structure in the Presence of Perturbations , 1997, AAAI/IAAI.
[42] Iris van Rooij,et al. Perceptual or analytical processing? : evidence from children's and adult's performance on the Euclidean Traveling Salesperson problem , 2008 .
[43] I. Rooij,et al. Convex hull and tour crossings in the Euclidean traveling salesperson problem: Implications for human performance studies , 2003, Memory & cognition.
[44] Toby Walsh,et al. Backbones in Optimization and Approximation , 2001, IJCAI.
[45] M. Lee,et al. The importance ofthe convex hull for human performance on the traveling salesman problem : A comment on MacGregor and Ormerod , 2010 .
[46] H. Barlow. Vision: A computational investigation into the human representation and processing of visual information: David Marr. San Francisco: W. H. Freeman, 1982. pp. xvi + 397 , 1983 .
[47] Toby Walsh,et al. The Backbone of the Travelling Salesperson , 2005, IJCAI.
[48] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[49] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[50] H. Simon,et al. A Behavioral Model of Rational Choice , 1955 .
[51] Ashish Sabharwal,et al. Tradeoffs in the Complexity of Backdoor Detection , 2007, CP.
[52] Iris van Rooij,et al. The Tractable Cognition Thesis , 2008, Cogn. Sci..
[53] J. Spencer,et al. Explosive Percolation in Random Networks , 2009, Science.
[54] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.