Sciweavers

218 search results - page 15 / 44
» Quantum-inspired evolutionary algorithm for a class of combi...
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 8 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
CEC
2005
IEEE
14 years 2 months ago
Memory-enhanced univariate marginal distribution algorithms for dynamic optimization problems
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...
Shengxiang Yang
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
13 years 12 months ago
Niching the CMA-ES via nearest-better clustering
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
Mike Preuss
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
13 years 6 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
ANOR
2011
131views more  ANOR 2011»
13 years 3 months ago
A branch-and-bound algorithm for hard multiple knapsack problems
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
Alex S. Fukunaga