275 search results - page 31 / 55 » The Attractive Traveling Salesman Problem |
107
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
COGSCI
2010
14 years 9 months ago
2010
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
HEURISTICS
2007
14 years 9 months ago
2007
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...