336 search results - page 7 / 68 » Consultant-guided search algorithms for the quadratic assign... |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
ISCIS
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
HPCC
2005
Springer
14 years 29 days ago
2005
Springer
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
CEC
2010
IEEE
13 years 4 months ago
2010
IEEE
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
ANOR
2011
12 years 11 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...