This release contains the final version of the Implicit Graph Multiobjective Dijkstra Algorithm used in our scientific publication. The algorithm solves the Multiobjective Minimum Spanning Trees (MO-MST) problem using a Dynamic Programming approach.
Our code includes our implementation of the previous state-of-the art MO-MST algorithm from the literature which is called the Built Network algorithm (https://doi.org/10.1016/j.cor.2018.05.007).