File Exchange

image thumbnail

Find multi-objective Pareto front using modified quicksort

version 1.0.0 (2.54 KB) by Tom R
This function returns the indices to the Pareto optimal set of designs for a given multi-objective solution space

15 Downloads

Updated 23 Oct 2019

View License

This function returns the indices to a given matrix corresponding to the pareto optimal set of designs. The underlying algorithm of this function is based on quicksort, and similarly achieves an expected run-time of O(n lg n + n_p) for n designs (n_p of which are pareto optimal) with a favorable leading coefficient. Its implementation is vectorized where possible, and supports any data type defined under <,>,or min().

Cite As

Tom R (2021). Find multi-objective Pareto front using modified quicksort (https://www.mathworks.com/matlabcentral/fileexchange/73089-find-multi-objective-pareto-front-using-modified-quicksort), MATLAB Central File Exchange. Retrieved .

Comments and Ratings (4)

Pablo Zumel

Yukun Fang

An excellent job and it do help me a lot in my work. Thanks, Tom R!

Piotr Slowinski

Federico Zappaterra

Very good code. Good job Tom R!

MATLAB Release Compatibility
Created with R2019b
Compatible with R2010b and later releases
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!