A PDE-based approach to non-dominated sorting
Numerical Analysis
2013-10-10 v1 Analysis of PDEs
Abstract
Non-dominated sorting is a fundamental combinatorial problem in multiobjective optimization, and is equivalent to the longest chain problem in combinatorics and random growth models for crystals in materials science. In a previous work, we showed that non-dominated sorting has a continuum limit that corresponds to solving a Hamilton-Jacobi equation. In this work we present and analyze a fast numerical scheme for this Hamilton-Jacobi equation, and show how it can be used to design a fast algorithm for approximate non-dominated sorting.
Cite
@article{arxiv.1310.2498,
title = {A PDE-based approach to non-dominated sorting},
author = {Jeff Calder and Selim Esedoglu and Alfred O. Hero},
journal= {arXiv preprint arXiv:1310.2498},
year = {2013}
}