Algorithms: Filter Sort

@inproceedings{ filter-sort,
    author = {Junchen Wang and Changhe Li and Yiya Diao
              and Sanyou Zeng and Hui Wang},
    title = {An efficient nondominated sorting algorithm},
    booktitle = {Proceedings of the Genetic and Evolutionary Computation
                 Conference Companion},
    pages = {203-204},
    year = {2018},
    publisher = {ACM},
    langid = {english}
}

How to get an instance:

• FilterSort.getInstance() -- returns the only available instance.

This is an algorithm with a couple of interesting ideas, which is able to run quite fast, but has the worst-case complexity of O(MN^3). The original implementation is available on GitHub. The implementation available in this project is written from scratch. Experimentally it seems to be always slower than Best Order Sort.