On a multicriteria shortest path problem
From MaRDI portal
Publication:790051
DOI10.1016/0377-2217(84)90077-8zbMath0533.90090MaRDI QIDQ790051
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)90077-8
algorithms; spanning tree; 444.90098; Multicriteria shortest path problems; multiple labelling scheme; non-dominated paths
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C31: Sensitivity, stability, parametric optimization
90B10: Deterministic network models in operations research
Related Items
Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa, The determination of the path with minimum-cost norm value, A bicriterion approach for routing problems in multimedia networks, Unnamed Item, Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, Label correcting methods to solve multicriteria shortest path problems, Routing with nonlinear multiattribute cost functions, A preference-based approach to spanning trees and shortest paths problems, An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint, On finding dissimilar Pareto-optimal paths, Bicriteria shortest path in networks of queues, An interactive approach to identify the best compromise solution for two objective shortest path problems, Analysis of multicriteria decision aid in Europe, A multicriteria Pareto-optimal path algorithm, Efficient solutions for the bicriteria network flow problem, Network reduction for the acyclic constrained shortest path problem, Connectedness of efficient solutions in multiple criteria combinatorial optimization, Time depending shortest-path problems with applications to railway networks, The interactive analysis of the multicriteria shortest path problem by the reference point method., Solving bicriteria 0--1 knapsack problems using a labeling algorithm., Fuzzy shortest path problems incorporating interactivity among paths., Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite, The fuzzy shortest path length and the corresponding shortest path in a network, A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks, An empirical investigation of some bicriterion shortest path algorithms, Dynamic shortest path in stochastic dynamic networks: Ship routing problem, Multiobjective routing problems, Multiobjective routing of hazardous materials in stochastic networks, Algorithms for time-dependent bicriteria shortest path problems, The shortest path problem with discrete fuzzy arc lengths, A new algorithm for the discrete fuzzy shortest path problem in a network, Multicriteria adaptive paths in stochastic, time-varying networks
Cites Work
