A biobjective Dijkstra algorithm
Year of publication: |
2019
|
---|---|
Authors: | Sedeño-noda, Antonio ; Colebrook, Marcos |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 276.2019, 1 (1.7.), p. 106-118
|
Subject: | Network optimization | Biobjective path problems | Efficient paths | Dijkstra's algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Sedeño-Noda, Antonio, (2015)
-
A lower bound for the quickest path problem
Giani, Gianpaolo, (2014)
-
A new algorithm to compute pareto-optimal paths in a multi objective fuzzy weighted network
Kumar, M. Karun, (2013)
- More ...
-
Optimality conditions in preference-based spanning tree problems
Alonso, Sergio, (2009)
-
Optimality conditions in preference-based spanning tree problems
Alonso, Sergio, (2009)
-
Optimality conditions in preference-based spanning tree problems
Alonso, Sergio, (2009)
- More ...