91 citations · 94 across the 2 of their papers we have counts for
3 papers
A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs
Anthony Przybylski, Kathrin Klamroth, Renaud Lacour
We present a simple and at the same time fficient algorithm to compute all nondominated extreme points in the outcome set of multi-objective mixed integer linear programmes in any…
A Box Decomposition Algorithm to Compute the Hypervolume Indicator
Renaud Lacour, Kathrin Klamroth, Carlos M. Fonseca
We propose a new approach to the computation of the hypervolume indicator, based on partitioning the dominated region into a set of axis-parallel hyperrectangles or boxes. We prese…
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…