Shortest paths with ordinal weights

被引：5

作者：

Schaefer, Luca E. ^{[1
]}

Dietz, Tobias ^{[1
]}

Froehlich, Nicolas ^{[1
]}

Ruzika, Stefan ^{[1
]}

Figueira, Jose R. ^{[2
]}

机构：

[1] Tech Univ Kaiserslautern, Dept Math, D-67663 Kaiserslautern, Germany

[2] Univ Lisbon, Inst Super Tecn, CEG IST, P-1049001 Lisbon, Portugal

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2020年 / 280卷 / 03期

关键词：

Networks; Ordinal scale; Ordinal shortest path problem; Preorder; Non-dominance; EFFICIENCY;

D O I：

10.1016/j.ejor.2019.08.008

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We investigate the single-source-single-destination "shortest" path problem in directed, acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and efficiency for paths and their associated ordinal levels, respectively. Further, we show that the number of ordinally non-dominated path vectors from the source node to every other node in the graph is polynomially bounded and we propose a polynomial time labeling algorithm for solving the problem of finding the set of ordinally non-dominated path vectors from source to sink. (C) 2019 Elsevier B.V. All rights reserved.

引用

页码：1160 / 1170

页数：11

共 50 条

[1] SHORTEST PATHS IN NETWORKS WITH VECTOR WEIGHTS
CORLEY, HW
MOON, ID
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1985, 46 (01) : 79 - 86
[2] ON SHORTEST PATHS IN GRAPHS WITH RANDOM WEIGHTS
HASSIN, R
ZEMEL, E
MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (04) : 557 - 564
[3] Shortest Paths in Networks with Correlated Link Weights
Yang, Song
Trajanovski, Stojan
Kuipers, Fernando A.
2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2015, : 660 - 665
[4] Parallel Shortest Paths with Negative Edge Weights
Cao, Nairen
Fineman, Jeremy T.
Russell, Katina
PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022, 2022, : 177 - 190
[5] On revising arc weights from known shortest paths
Koh, SLP
Pan, KL
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1995, 12 (02) : 129 - 143
[6] Exact Shortest Paths with Rational Weights on the Word RAM
Karczmarz, Adam
Nadara, Wojciech
Sokolowski, Marek
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2597 - 2608
[7] LABELED SHORTEST PATHS IN DIGRAPHS WITH NEGATIVE AND POSITIVE EDGE WEIGHTS
Bradford, Phillip G.
Thomas, David A.
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (03): : 567 - 583
[8] Successive shortest paths in complete graphs with random edge weights
Gerke, Stefanie
Mezei, Balazs F.
Sorkin, Gregory B.
RANDOM STRUCTURES & ALGORITHMS, 2020, 57 (04) : 1205 - 1247
[9] Fully dynamic shortest paths in digraphs with arbitrary arc weights
Frigioni, D
Marchetti-Spaccamela, A
Nanni, U
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 49 (01): : 86 - 113
[10] Stability of shortest paths in complex networks with random edge weights
Noh, JD
Rieger, H
PHYSICAL REVIEW E, 2002, 66 (06) : 8

← 1 2 3 4 5 →