Hierarchical Multiobjective Shortest Path Problems

DOI10.1007/978-3-030-66723-8_16zbMath1469.68103OpenAlexW3128363145MaRDI QIDQ3381971

No author found.

Publication date: 20 September 2021

Published in: Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-66723-8_16

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A survey on multi-constrained optimal path computation: exact and approximate algorithms
• On a multicriteria shortest path problem
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• The tricriterion shortest path problem with at least two bottleneck objective functions
• Linear and combinatorial optimization in ordered algebraic structures
• Dijkstra, Floyd and Warshall meet Kleene
• Least-violating control strategy synthesis with safety rules
• Heuristic Search for the Analysis of Graph Transition Systems
• Multiobjective A ^* search with consistent heuristics
• Multiobjective A*
• Planning Algorithms

This page was built for publication: Hierarchical Multiobjective Shortest Path Problems