On the sum-max bicriterion path problem.
From MaRDI portal
Publication:1406718
DOI10.1016/S0305-0548(98)00036-7zbMath1040.90557OpenAlexW2005800228MaRDI QIDQ1406718
Pascual Fernández, Blas Pelegrín
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00036-7
Related Items (9)
Fast and fine quickest path algorithm ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ The energy-constrained quickest path problem ⋮ Generalized multiple objective bottleneck problems ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Location of paths on trees with minimal eccentricity and superior section ⋮ The centdian subtree on tree networks
Cites Work
- Unnamed Item
- A parametric approach to solving bicriterion shortest path problems
- The quickest path problem
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- The shortest path problem with two objective functions
- A bicriterion shortest path algorithm
- Algorithms for the quickest path problem and the enumeration of quickest paths
- An algorithm for finding the \(k\) quickest paths in a network
- On the quickest path problem
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- Multiobjective routing problems
- The all-pairs quickest path problem
- Shortest-path algorithms: Taxonomy and annotation
- Shortest path methods: A unifying approach
- Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
- The constrained shortest path problem
This page was built for publication: On the sum-max bicriterion path problem.
