On algorithms for the tricriteria shortest path problem with two bottleneck objective functions

DOI10.1016/j.cor.2010.01.005zbMath1188.90246OpenAlexW2074283850MaRDI QIDQ976042

Marta M. B. Pascoal, Leizer Lima Pinto

Publication date: 11 June 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.01.005

zbMATH Keywords

cost functionPareto-optimal solutionbottleneck functiontricriteria path problem

Mathematics Subject Classification ID

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

Related Items (7)

An aggregate label setting policy for the multi-objective shortest path problem ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Generalized multiple objective bottleneck problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a multicriteria shortest path problem
• On a special class of bicriterion path problems
• A parametric approach to solving bicriterion shortest path problems
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• A comparison of solution strategies for biobjective shortest path problems
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• The tricriterion shortest path problem with at least two bottleneck objective functions
• A bicriterion shortest path algorithm
• A multicriteria Pareto-optimal path algorithm
• An empirical investigation of some bicriterion shortest path algorithms
• A label correcting approach for solving bicriterion shortest-path problems
• The Constrained Bottleneck Problem in Networks
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: On algorithms for the tricriteria shortest path problem with two bottleneck objective functions