A biobjective Dijkstra algorithm
type: Item
instance of: scholarly article
title: A biobjective Dijkstra algorithm
zbMATH Open document ID: 1430.90517
author: Marcos Colebrook
author: Antonio Sedeño-Noda
published in: European Journal of Operational Research
publication date: 2019-02-25T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 7029254
zbMATH Keywords: network optimization
zbMATH Keywords: biobjective path problems
zbMATH Keywords: efficient paths
zbMATH Keywords: Dijkstra's algorithm
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.01.007
OpenAlex ID: W2909085420
cites work: Q3056948
cites work: Analysis of FPTASes for the multi-objective shortest path problem
cites work: Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
cites work: Q3651735
cites work: Speeding up Martins' algorithm for multiple objective shortest path problems
cites work: A note on two problems in connexion with graphs
cites work: An exact method for the biobjective shortest path problem for large-scale road networks
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Computing the shortest path: \(A^\ast\) search meets graph theory
cites work: Label correcting methods to solve multicriteria shortest path problems
cites work: Q3888874
cites work: Q3914777
cites work: On a multicriteria shortest path problem
cites work: A parametric approach to solving bicriterion shortest path problems
cites work: Finding the Shortest Route between Two Points in a Network
cites work: Q5679703
cites work: A comparison of solution strategies for biobjective shortest path problems
cites work: A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
cites work: A label correcting approach for solving bicriterion shortest-path problems
cites work: Multiobjective A*
Wikidata QID: Q128625507
DOI: 10.1016/J.EJOR.2019.01.007
Recommended article: A comparison of solution strategies for biobjective shortest path problems
Recommended article: A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
Recommended article: Shortest paths with shortest detours. A biobjective routing problem
Recommended article: Targeted multiobjective Dijkstra algorithm
Recommended article: An exact method for the biobjective shortest path problem for large-scale road networks
Recommended article: Q3202146
Recommended article: The problem of the optimal biobjective spanning tree
Recommended article: A parallel bio-inspired shortest path algorithm
Recommended article: Heuristics for the bi-objective path dissimilarity problem
Recommended article: Q4915506
description: scientific article; zbMATH DE number 7029254