non-dominated-sorting-implementations

This repository contains implementations of algorithms for non-dominated sorting and a benchmarking suite.

License	MIT
Categories	MINA Net Networking
GroupId	com.github.mbuzdalov
ArtifactId	non-dominated-sorting-implementations
Last Version	0.2.1
Release Date	Nov 25, 2019
Type	jar
Description	non-dominated-sorting-implementations This repository contains implementations of algorithms for non-dominated sorting and a benchmarking suite.
Project URL	https://github.com/mbuzdalov/non-dominated-sorting
Project Organization	Maxim Buzdalov
Source Code Management	https://github.com/mbuzdalov/non-dominated-sorting

Download non-dominated-sorting-implementations

Filename	Size
non-dominated-sorting-implementations-0.2.1.pom
non-dominated-sorting-implementations-0.2.1.jar	115 KB
non-dominated-sorting-implementations-0.2.1-sources.jar	74 KB
non-dominated-sorting-implementations-0.2.1-javadoc.jar	217 KB

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/com.github.mbuzdalov/non-dominated-sorting-implementations/ -->
<dependency>
    <groupId>com.github.mbuzdalov</groupId>
    <artifactId>non-dominated-sorting-implementations</artifactId>
    <version>0.2.1</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/com.github.mbuzdalov/non-dominated-sorting-implementations/
implementation 'com.github.mbuzdalov:non-dominated-sorting-implementations:0.2.1'

Gradle Kotlin

// https://jarcasting.com/artifacts/com.github.mbuzdalov/non-dominated-sorting-implementations/
implementation ("com.github.mbuzdalov:non-dominated-sorting-implementations:0.2.1")

Apache Buildr

'com.github.mbuzdalov:non-dominated-sorting-implementations:jar:0.2.1'

Apache Ivy

<dependency org="com.github.mbuzdalov" name="non-dominated-sorting-implementations" rev="0.2.1">
  <artifact name="non-dominated-sorting-implementations" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='com.github.mbuzdalov', module='non-dominated-sorting-implementations', version='0.2.1')
)

Scala SBT

libraryDependencies += "com.github.mbuzdalov" % "non-dominated-sorting-implementations" % "0.2.1"

Leiningen

[com.github.mbuzdalov/non-dominated-sorting-implementations "0.2.1"]

Dependencies

test (1)

Group / Artifact	Type	Version
com.novocode : junit-interface	jar	0.11

Project Modules

There are no modules declared in this project.

non-dominated-sorting

This repository contains implementations of algorithms for non-dominated sorting and a benchmarking suite.

Algorithms

The following algorithms are currently implemented:

• Fast Non-Dominated Sorting
• Deductive Sort
• Corner Sort
• Dominance Tree
• ENS
• Best Order Sort
• Jensen-Fortin-Buzdalov divide-and-conquer method
• Sumit Mishra divide-and-conquer method
• ENS-NDT, aka Non-Dominated Tree by Gustavsson and Syberfeldt
• Filter Sort
• Set Intersection Sort

Acknowledgments

The following contributors would like to acknowledge the support of this research by the Russian Scientific Foundation, agreement 17-71-20178:

• Maxim Buzdalov
• Margarita Markina

See also

Links to other implementations of non-dominated sorting

• Official sources of Best Order Sort and Bounded Best Order Sort
• Various algorithms in Java by the author of Best Order Sort
• Implementation of the Jensen-Fortin-Buzdalov approach in C#
• Implementation of the Jensen-Fortin-Buzdalov approach in Python
• Implementation of the Deb's fast NDS in Rust
• A rather stale project in C++ that proposed Filter Sort
• Parallel implementation of Best Order Sort

Links to related projects about similar problems

• Data Structures for Non-Dominated Sets by Jonathan Fieldsend
• Skyline queries (aka finding the first non-dominated layer) in Python
• Generalized Offline Orthant Search
• Generalized Online Orthant Search

Versions

Version
0.2.1 Nov 25, 2019