On a special class of bicriterion path problems
The authors are concerned with a special class of bicriterion path problems. For the considered class of bicriterion problems at least one of the objective is of a maxmin type. The second objective is either of a minsum or of a minratio type. Two algorithms are presented for the considered class of bicriterion path problems. The first one only determines the minimal complete set of nondominated paths and the second one determines the entire set of nondominated paths. Both algorithms can be used for any type of bicriterion path problems, since one of the objectives is of a maxmin type and an algorithm exists to determine the best path for the other objective. Computational experiments for the three types of considered bicriterion path problems is reported.
- 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
- A bicriterion shortest path algorithm
- An algorithm for ranking paths that may contain cycles
- 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?)
- Shortest Path and Network Flow Algorithms
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- The tricriterion shortest path problem with at least two bottleneck objective functions
- An algorithm for the quickest path problem
- Paths with minimum range and ratio of arc lengths
- On the sum-max bicriterion path problem.
- Dealing with residual energy when transmitting data in energy-constrained capacitated networks
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
- An empirical investigation of some bicriterion shortest path algorithms
- Bi-criteria path problem with minimum length and maximum survival probability
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- A comprehensive survey on the quickest path problem
- Bicriteria path problem minimizing the cost and minimizing the number of labels
- Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
- A bicriterion approach for routing problems in multimedia networks
- scientific article; zbMATH DE number 1783874 (Why is no real title available?)
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Two-criteria stream programming problems
- An algorithm to determine a path with minimal cost/capacity ratio
- An algorithm to determine a path with minimal cost/capacity ratio
- An aggregate label setting policy for the multi-objective shortest path problem
- A parametric approach to solving bicriterion shortest path problems
- Optimal paths in bi-attribute networks with fractional cost functions
- On algorithms for the tricriteria shortest path problem with two bottleneck objective 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)
