Shortest Paths with Ordinal Weights.
European Journal of Operational Research(2020)
摘要
•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.
更多查看译文
关键词
Networks,Ordinal scale,Ordinal shortest path problem,Preorder,Non-dominance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络