5316 search results - page 58 / 1064 » Which Search Problems Are Random |
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
97
Voted
EVOW
2007
Springer
15 years 7 months ago
2007
Springer
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
112
Voted
SEAL
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research we...
106
click to vote
IJKESDP
2010
14 years 11 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
100
Voted
CPAIOR
2007
Springer
15 years 7 months ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...