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
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Sensitivity, stability, parametric optimization (90C31) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- An algorithm for ranking paths that may contain cycles
- A bicriterion shortest path algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest Path and Network Flow Algorithms
Cited In (22)
- Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
- A bicriterion approach for routing problems in multimedia networks
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
- Dealing with residual energy when transmitting data in energy-constrained capacitated networks
- An algorithm to determine a path with minimal cost/capacity ratio
- An empirical investigation of some bicriterion shortest path algorithms
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- An algorithm to determine a path with minimal cost/capacity ratio
- 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 algorithm for the quickest path problem
- On the sum-max bicriterion path problem.
- Title not available (Why is that?)
- A parametric approach to solving bicriterion shortest path problems
- Two-criteria stream programming problems
- An aggregate label setting policy for the multi-objective shortest path problem
- A comprehensive survey on the quickest path problem
- Optimal paths in bi-attribute networks with fractional cost functions
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Paths with minimum range and ratio of arc lengths
- Bicriteria path problem minimizing the cost and minimizing the number of labels
- Bi-criteria path problem with minimum length and maximum survival probability
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)
