Shortest paths with ordinal weights

DOI10.1016/j.ejor.2019.08.008zbMath1430.90171arXiv1808.09410OpenAlexW2968664447WikidataQ127389093 ScholiaQ127389093MaRDI QIDQ2327649

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

Publication date: 15 October 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.09410

zbMATH Keywords

networkspreorderordinal scalenon-dominanceordinal shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Signed and weighted graphs (05C22)

Related Items (3)

Multi-objective matroid optimization with ordinal weights ⋮ Ordinal optimization through multi-objective reformulation ⋮ The binary knapsack problem with qualitative levels

Cites Work

• Unnamed Item
• Integer programming formulations for the elementary shortest path problem
• A preference-based approach to spanning trees and shortest paths problems
• A minmax regret version of the time-dependent shortest path problem
• On a multicriteria shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• The \(k\)-centrum shortest path problem
• On \(k\)-Max-optimization
• Optimality conditions in preference-based spanning tree problems
• Ordinal efficiency and dominated sets of assignments.
• Bottleneck shortest paths on a partially ordered scale
• A biobjective Dijkstra algorithm
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Shortest paths algorithms: Theory and experimental evaluation
• Fairness and efficiency in strategy-proof object allocation mechanisms
• An exact method for the biobjective shortest path problem for large-scale road networks
• Sorted-Pareto Dominance and Qualitative Notions of Optimality

This page was built for publication: Shortest paths with ordinal weights