2126 search results - page 31 / 426 » An optimization algorithm for imprecise multi-objective prob... |
WG
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
ORL
1998
14 years 9 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
118
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
KES
2005
Springer
15 years 3 months ago
2005
Springer
This paper introduces Dafo, a new multi-agent framework for evolutionary optimization relying on a competitive coevolutionary genetic algorithm, aka LCGA (Loosely Coupled Genetic A...