On a special class of bicriterion path problems

DOI10.1016/0377-2217(84)90011-0zbMATH Open0538.90086OpenAlexW1970287505MaRDI QIDQ793640FDOQ793640

Authors 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) Deterministic network models in operations research (90B10) Sensitivity, stability, parametric optimization (90C31) Paths and cycles (05C38)

Recommendations

• On the sum-max bicriterion path problem.
• An empirical investigation of some bicriterion shortest path algorithms
• The tricriterion shortest path problem with at least two bottleneck objective functions
• A parametric approach to solving bicriterion shortest path problems
• scientific article; zbMATH DE number 792650

Cites work

• scientific article; zbMATH DE number 3965788 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 3726107 (Why is no real title available?)
• scientific article; zbMATH DE number 3478624 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• A bicriterion shortest path algorithm
• An algorithm for ranking paths that may contain cycles
• Shortest Path and Network Flow Algorithms
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

Cited in

(22)

• Bi-criteria path problem with minimum length and maximum survival probability
• An aggregate label setting policy for the multi-objective shortest path problem
• scientific article; zbMATH DE number 1783874 (Why is no real title available?)
• An algorithm for the quickest path problem
• Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• An empirical investigation of some bicriterion shortest path algorithms
• A parametric approach to solving bicriterion shortest path problems
• Paths with minimum range and ratio of arc lengths
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• An algorithm to determine a path with minimal cost/capacity ratio
• On the sum-max bicriterion path problem.
• Bicriteria path problem minimizing the cost and minimizing the number of labels
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
• A comprehensive survey on the quickest path problem
• An algorithm to determine a path with minimal cost/capacity ratio
• The tricriterion shortest path problem with at least two bottleneck objective functions
• Two-criteria stream programming problems
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• A bicriterion approach for routing problems in multimedia networks
• Optimal paths in bi-attribute networks with fractional cost functions

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

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