Sciweavers

8 search results - page 1 / 2
» Iterated Tabu Search for the Unconstrained Binary Quadratic ...
Sort
View
INFORMATICALT
2006
110views more  INFORMATICALT 2006»
13 years 4 months ago
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
Gintaras Palubeckis
4OR
2010
82views more  4OR 2010»
13 years 4 months ago
Diversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
Fred Glover, Zhipeng Lü, Jin-Kao Hao
ANOR
2011
117views more  ANOR 2011»
12 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
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...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
13 years 10 months ago
The enhanced evolutionary tabu search and its application to the quadratic assignment problem
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
John F. McLoughlin III, Walter Cedeño
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 5 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya