Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
— Hypervolume based multiobjective evolutionary algorithms (MOEA) nowadays seem to be the first choice when handling multiobjective optimization problems with many, i.e., at lea...
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
This paper studies the influence of what are recognized as key issues in evolutionary multi-objective optimization: archiving (to keep track of the current non-dominated solutions...
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...