Targeted multiobjective Dijkstra algorithm

DOI10.1002/net.22174zbMath1529.90088arXiv2110.10978OpenAlexW4383621574MaRDI QIDQ6139383

Antonio Sedeño-Noda, Unnamed Author, Ralf Borndörfer, Pedro Maristany de las Casas

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.10978

zbMATH Keywords

dynamic programmingheuristic searchlabel settingmultiobjective shortest path\(\mathrm{A}^*\)multiobjective Dijkstra

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Cites Work

• A note on two problems in connexion with graphs
• Multiobjective shortest path problems with lexicographic goal-based preferences
• Dimensionality reduction in multiobjective shortest path search
• On a multicriteria shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• A biobjective Dijkstra algorithm
• A label correcting approach for solving bicriterion shortest-path problems
• An improved multiobjective shortest path algorithm
• Multiobjective A ^* search with consistent heuristics
• Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
• Multicriteria Optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: Targeted multiobjective Dijkstra algorithm