Sciweavers

6 search results - page 2 / 2
» Diversification-driven tabu search for unconstrained binary ...
Sort
View
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
13 years 11 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
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...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa