Shortest paths with ordinal weights
Year of publication: |
2020
|
---|---|
Authors: | Schäfer, Luca E. ; Dietz, Tobias ; Fröhlich, Nicolas ; Ruzika, Stefan ; Figueira, José Rui |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 280.2020, 3 (1.2.), p. 1160-1170
|
Subject: | Networks | Non-dominance | Ordinal scale | Ordinal shortest path problem | Preorder |
-
The binary knapsack problem with qualitative levels
Schäfer, Luca E., (2021)
-
How to score alternatives when criteria are scored on an ordinal scale
Grabisch, Michel, (2008)
-
Interval estimation of gamma for anR×S table
Lui, Kung-Jong, (2004)
- More ...
-
The binary knapsack problem with qualitative levels
Schäfer, Luca E., (2021)
-
Introducing multiobjective complex systems
Dietz, Tobias, (2020)
-
Interdicting facilities in tree networks
Fröhlich, Nicolas, (2021)
- More ...