Approximating the Pareto Front of Multi-criteria Optimization Problems

Abstract

We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constraint solver. Hence, in addition to a set of solutions, we can guarantee bounds on the distance to the actual Pareto front and use this distance to guide the search. Our… (More)
DOI: 10.1007/978-3-642-12002-2_6

Topics

9 Figures and Tables

Statistics

0510201020112012201320142015201620172018
Citations per Year

61 Citations

Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics