A multicriteria Pareto-optimal path algorithm
From MaRDI portal
Publication:1196025
DOI10.1016/0377-2217(92)90248-8zbMath0769.90079OpenAlexW1970166004MaRDI QIDQ1196025
Publication date: 4 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90248-8
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (29)
Multiobjective shortest path problems with lexicographic goal-based preferences ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ Two exact algorithms for the traveling umpire problem ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Multiobjective routing problems ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Finding all nondominated points of multi-objective integer programs ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ An aggregate label setting policy for the multi-objective shortest path problem ⋮ The Steiner bi-objective shortest path problem ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ Lower bound sets for biobjective shortest path problems ⋮ A comparison of heuristic best-first algorithms for bicriterion shortest path problems ⋮ Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ Non-additive shortest path in the context of traffic assignment ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions ⋮ Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles ⋮ Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite ⋮ Vector equilibrium problem and vector optimization
Cites Work
This page was built for publication: A multicriteria Pareto-optimal path algorithm
