A parametric approach to solving bicriterion shortest path problems
From MaRDI portal
Publication:810382
DOI10.1016/0377-2217(91)90094-CzbMATH Open0733.90073MaRDI QIDQ810382FDOQ810382
Authors: John Mote, Ishwar Murthy, David L. Olson 
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Efficient solution generation for the bicriterion shortest path problems
- An empirical investigation of some bicriterion shortest path algorithms
- An interactive procedure using domination cones for bicriterion shortest path problems
- On a special class of bicriterion path problems
- scientific article
- A label correcting approach for solving bicriterion shortest-path problems
- Two-phase algorithms for the parametric shortest path problem
- On a multicriteria shortest path problem
- Algorithms for time-dependent bicriteria shortest path problems
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
LP relaxationparametric approachPareto-optimal pathsbicriterion network problembicriterion shortest pathlabel correcting procedure
Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- A note on two problems in connexion with graphs
- On a routing problem
- Title not available (Why is that?)
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- A bicriterion shortest path algorithm
- Solving Bicriterion Mathematical Programs
- Finding the K Shortest Loopless Paths in a Network
- Title not available (Why is that?)
- Linear Multiparametric Programming by Multicriteria Simplex Method
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Shortest-path algorithms: Taxonomy and annotation
- The shortest path problem with two objective functions
- Title not available (Why is that?)
- An algorithm for bicriterion linear programming
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
Cited In (38)
- A biobjective Dijkstra algorithm
- Routing with nonlinear multiattribute cost functions
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- A preference-based approach to spanning trees and shortest paths problems
- A relation of dominance for the bicriterion bus routing problem
- Extended dominance and a stochastic shortest path problem
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- Clusters of non-dominated solutions in multiobjective combinatorial optimization: an experimental analysis
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- Efficient solution generation for the bicriterion shortest path problems
- An empirical investigation of some bicriterion shortest path algorithms
- A label correcting approach for solving bicriterion shortest-path problems
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- Analysis of FPTASes for the multi-objective shortest path problem
- A comparison of solution strategies for biobjective shortest path problems
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
- On a special class of bicriterion path problems
- On the sum-max bicriterion path problem.
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- Multiobjective routing problems
- Label correcting methods to solve multicriteria shortest path problems
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- Solving multi-objective traffic assignment
- On a parametric shortest path problem from primal—dual multicommodity network optimization
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Optimal paths in bi-attribute networks with fractional cost functions
- Algorithms for time-dependent bicriteria shortest path problems
- The interactive analysis of the multicriteria shortest path problem by the reference point method.
- The Steiner bi-objective shortest path problem
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Multicriteria adaptive paths in stochastic, time-varying networks
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- The \(k\)-centrum shortest path problem
This page was built for publication: A parametric approach to solving bicriterion shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810382)
