On a special class of bicriterion path problems

DOI10.1016/0377-2217(84)90011-0zbMath0538.90086OpenAlexW1970287505MaRDI QIDQ793640

Ernesto Queirós Vieira Martins

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90011-0

zbMATH Keywords

multiple criteria programmingbicriterion path problemsnondominated paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Related Items (14)

Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ A comprehensive survey on the quickest path problem ⋮ An algorithm for the quickest path problem ⋮ Paths with minimum range and ratio of arc lengths ⋮ An aggregate label setting policy for the multi-objective shortest path problem ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ An algorithm to determine a path with minimal cost/capacity ratio ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ An algorithm to determine a path with minimal cost/capacity ratio ⋮ 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 ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions

Cites Work

• An algorithm for ranking paths that may contain cycles
• A bicriterion shortest path algorithm
• Shortest Path and Network Flow Algorithms
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a special class of bicriterion path problems