Search for the best compromise solution on Multiobjective shortest path problem

DOI10.1016/j.endm.2010.05.078zbMath1237.90226OpenAlexW2028851553MaRDI QIDQ2883625

Gaël Sauvanet, Emmanuel Néron

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.078

zbMATH Keywords

multiobjective shortest path problembest compromise A*

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items (2)

An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Ordinal optimization through multi-objective reformulation

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Multiobjective A*
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms

This page was built for publication: Search for the best compromise solution on Multiobjective shortest path problem