Shortest paths with ordinal weights-Reference-Cited by-同舟云学术

Shortest paths with ordinal weights

Published:2020-02 Issue:3 Volume:280 Page:1160-1170
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Schäfer Luca E.^ORCID,Dietz Tobias,Fröhlich Nicolas,Ruzika Stefan,Figueira José R.^ORCID

Funder

BMBF

Deutsche Forschungsgemeinschaft

FCT

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference22 articles.

1. Ordinal efficiency and dominated sets of assignments;Abdulkadiroglu;Journal of Economic Theory,2003

2. Optimality conditions in preference-based spanning tree problems;Alonso;European Journal of Operational Research,2009

3. Minimal paths on ordered graphs;Bossong;Mathematica Slovaca,2006

4. Shortest paths algorithms: Theory and experimental evaluation;Cherkassky;Mathematical Programming,1996

5. A minmax regret version of the time-dependent shortest path problem;Conde;European Journal of Operational Research,2018

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ordinal optimization through multi-objective reformulation;European Journal of Operational Research;2023-12

2. Modelling Finite State Automata to Find Shortest Path;Advances in Social Science, Education and Humanities Research;2023

3. Multi-objective matroid optimization with ordinal weights;Discrete Applied Mathematics;2022-08

4. The binary knapsack problem with qualitative levels;European Journal of Operational Research;2021-03

5. An experimental analysis of least-cost path models on ordinal-scaled raster surfaces;International Journal of Geographical Information Science;2020-06-29