158 search results - page 4 / 32 » On Complexity of Optimal Recombination for Binary Representa... |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...