91 citations · 95 across the 5 of their papers we have counts for
6 papers
Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization
Felipe O. Mota, Luís Paquete, Daniel Vanderpooten
Two-phase methods are commonly used to solve bi-objective combinatorial optimization problems. In the first phase, all extreme supported nondominated points are generated through a…
Approximating Multiobjective Optimization Problems: How exact can you be?
Cristina Bazgan, Arne Herzel, Stefan Ruzika +2
It is well known that, under very weak assumptions, multiobjective optimization problems admit -approximation sets (also called -P…
Exact and approximate determination of the Pareto set using minimal correction subsets
Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten +4
Recently, it has been shown that the enumeration of Minimal Correction Subsets (MCS) of Boolean formulas allows solving Multi-Objective Boolean Optimization (MOBO) formulations. Ho…
One-Exact Approximate Pareto Sets
Arne Herzel, Cristina Bazgan, Stefan Ruzika +2
Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit…
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems
Cristina Bazgan, Stefan Ruzika, Clemens Thielen +1
We determine the power of the weighted sum scalarization with respect to the computation of approximations for general multiobjective minimization and maximization problems. Additi…
On the representation of the search region in multi-objective optimization
Kathrin Klamroth, Renaud Lacour, Daniel Vanderpooten
Given a finite set of feasible points of a multi-objective optimization (MOO) problem, the search region corresponds to the part of the objective space containing all the point…