Name
Abstract | ||
|---|---|---|
•We define a specific preorder on the set of s–t-paths.•The number of ordinally efficient paths can be exponential in the number of nodes.•The number of ordinally non-dominated paths is polynomially bounded.•We present a polynomial time algorithm computing all ordinally non-dominated paths. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ejor.2019.08.008 | European Journal of Operational Research |
Keywords | Field | DocType |
Networks,Ordinal scale,Ordinal shortest path problem,Preorder,Non-dominance | Discrete mathematics,Graph,Combinatorics,Arc (geometry),Ordinal number,Time complexity,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
280 | 3 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca E. Schäfer | 1 | 0 | 0.68 |
| Tobias Dietz | 2 | 0 | 2.03 |
| Nicolas Fröhlich | 3 | 0 | 0.34 |
| Stefan Ruzika | 4 | 174 | 21.91 |
| José Rui Figueira | 5 | 852 | 59.84 |