2126 search results - page 108 / 426 » An optimization algorithm for imprecise multi-objective prob... |
161
Voted
CP
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
149
click to vote
EMO
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
135
click to vote
WEA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
116
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
131
Voted
CSO
2009
IEEE
15 years 11 months ago
2009
IEEE
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...