Sciweavers

6 search results - page 2 / 2
» Diversification-driven tabu search for unconstrained binary ...
Sort
View
92
Voted
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 1 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