Lower bound sets for biobjective shortest path problems

DOI10.1007/s10898-015-0324-1zbMath1339.90304OpenAlexW801043424MaRDI QIDQ905755

Enrique Machuca, Lawrence Mandow

Publication date: 28 January 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0324-1

zbMATH Keywords

bound setsbiobjective shortest path problemmultiobjective \(A^*\)road maps

Mathematics Subject Classification ID

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

Related Items (1)

An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A comparison of heuristic best-first algorithms for bicriterion shortest path problems
• Optimal placement of UV-based communications relay nodes
• An aggregate label setting policy for the multi-objective shortest path problem
• Inconsistent heuristics in theory and practice
• On a multicriteria shortest path problem
• Bound sets for biobjective combinatorial optimization problems
• A comparison of solution strategies for biobjective shortest path problems
• A multicriteria Pareto-optimal path algorithm
• Utility of pathmax in partial order heuristic search
• Computation of the reverse shortest-path problem
• On the cardinality of the Pareto set in bicriteria shortest path problems
• Speeding up Martins' algorithm for multiple objective shortest path problems
• A Case of Pathology in Multiobjective Heuristic Search
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• On the selection of k routes in multiobjective hazmat route planning
• Multiobjective A ^* search with consistent heuristics
• Generalized best-first search strategies and the optimality of A*
• Bicriteria Transportation Problem
• Multiobjective A*

This page was built for publication: Lower bound sets for biobjective shortest path problems