Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function

DOI10.1007/s10288-005-0074-xzbMath1125.90405OpenAlexW1998259641MaRDI QIDQ862814

Sabine Randriamasy, Xavier Gandibleux, Frédéric Beugnies

Publication date: 24 January 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-005-0074-x

zbMATH Keywords

shortest path problemlabelling algorithm.Multi-objective combinatorial optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Paths and cycles (05C38) Network protocols (68M12)

Related Items (17)

Uncertain programming models for multi-objective shortest path problem with uncertain parameters ⋮ An evolutionary approach to generalized biobjective traveling salesperson problem ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ An improved multiobjective shortest path algorithm ⋮ An aggregate label setting policy for the multi-objective shortest path problem ⋮ An interactive algorithm for multi-objective route planning ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Generalized multiple objective bottleneck problems ⋮ Risk approaches for delivering disaster relief supplies ⋮ 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 ⋮ Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty ⋮ Hierarchical Multiobjective Shortest Path Problems ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions ⋮ Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications ⋮ A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm

This page was built for publication: Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function