Publication Date
| In 2026 | 0 |
| Since 2025 | 0 |
| Since 2022 (last 5 years) | 0 |
| Since 2017 (last 10 years) | 0 |
| Since 2007 (last 20 years) | 1 |
Descriptor
| Cognitive Processes | 2 |
| Foreign Countries | 2 |
| Performance | 2 |
| Problem Solving | 2 |
| Adults | 1 |
| Age Differences | 1 |
| Children | 1 |
| College Students | 1 |
| Comparative Analysis | 1 |
| Computation | 1 |
| Decision Making | 1 |
| More ▼ | |
Source
| Journal of Problem Solving | 2 |
Author
| Dry, Matthew J. | 1 |
| Fontaine, Elizabeth L. | 1 |
| Kadlec, Helena | 1 |
| Schactman, Alissa | 1 |
| Stege, Ulrike | 1 |
| van Rooij, Iris | 1 |
Publication Type
| Journal Articles | 2 |
| Reports - Research | 2 |
Education Level
| Higher Education | 1 |
| Postsecondary Education | 1 |
Audience
Location
| Australia | 2 |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewed
Direct linkDry, Matthew J.; Fontaine, Elizabeth L. – Journal of Problem Solving, 2014
The Traveling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization problem. In spite of its relative difficulty, human solvers are able to generate close-to-optimal solutions in a close-to-linear time frame, and it has been suggested that this is due to the visual system's inherent sensitivity to certain geometric…
Descriptors: Problem Solving, Geographic Location, Computation, Visual Stimuli
van Rooij, Iris; Schactman, Alissa; Kadlec, Helena; Stege, Ulrike – Journal of Problem Solving, 2006
The Euclidean Traveling Salesperson Problem (E-TSP) is a useful task to study how humans optimize when faced with computational intractability. It has been found that humans are capable of finding high-quality solutions for E-TSP in a relatively short time and with seemingly little cognitive effort. This observation has led to two general…
Descriptors: Problem Solving, Cognitive Processes, Children, Adults
