A comparison of heuristic best-first algorithms for bicriterion shortest path problems
Year of publication: |
2012
|
---|---|
Authors: | Machuca, E. ; Mandow, L. ; Cruz, J. L. Pérez de la ; Ruiz-Sepulveda, A. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 217.2012, 1 (16.2.), p. 44-53
|
Subject: | Heuristik | Heuristics | Algorithmus | Algorithm | Operations Research | Operations research | Graphentheorie | Graph theory |
-
Incremental network design with shortest paths
Baxter, Matthew, (2014)
-
An exact algorithm for the elementary shortest path problem with resource constraints
Lozano, Leonardo, (2016)
-
Exact and heuristic algorithms for the design of hub networks with multiple lines
Martins de Sá, Elisangela, (2015)
- More ...
-
A comparison of heuristic best-first algorithms for bicriterion shortest path problems
Machuca, E., (2012)
-
A comparison of heuristic best-first algorithms for bicriterion shortest path problems
Machuca, E., (2012)
-
Multicriteria heuristic search
Mandow, L., (2003)
- More ...