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

DOI10.1016/J.COR.2010.01.005zbMATH Open1188.90246OpenAlexW2074283850MaRDI QIDQ976042FDOQ976042

Authors: Leizer Lima Pinto, Marta M. B. Pascoal 

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

Recommendations

• The tricriterion shortest path problem with at least two bottleneck objective functions
• A parametric approach to solving bicriterion shortest path problems
• The shortest path problem with two objective functions
• On a multicriteria shortest path problem
• Multi-criteria approximation schemes for the resource constrained shortest path problem
• Two-phase algorithms for the parametric shortest path problem
• Efficient solution generation for the bicriterion shortest path problems
• An empirical investigation of some bicriterion shortest path algorithms
• Algorithms for two bottleneck optimization problems
• Algorithms for time-dependent bicriteria shortest path problems

zbMATH Keywords

cost functionPareto-optimal solutionbottleneck functiontricriteria path problem

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• An empirical investigation of some bicriterion shortest path algorithms
• A label correcting approach for solving bicriterion shortest-path problems
• A bicriterion shortest path algorithm
• A multicriteria Pareto-optimal path algorithm
• Title not available (Why is that?)
• On a multicriteria shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• Label correcting methods to solve multicriteria shortest path problems
• Title not available (Why is that?)
• A parametric approach to solving bicriterion shortest path problems
• The tricriterion shortest path problem with at least two bottleneck objective functions
• The Constrained Bottleneck Problem in Networks
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• On a special class of bicriterion path problems

Cited In (9)

• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
• An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
• Generalized multiple objective bottleneck problems
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• 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
• An aggregate label setting policy for the multi-objective shortest path problem
• The shortest path problem with two objective functions
• Speeding up Martins' algorithm for multiple objective shortest path problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976042)