The determination of the path with minimum-cost norm value

DOI10.1002/net.10077zbMath1090.90190MaRDI QIDQ4419275

José Luis Santos, Ernesto de Queirós Vieira Martins, José M. P. Paixão, Mário S. Rosa

Publication date: 31 July 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/8225

zbMATH Keywords

dominance relation; multiobjective shortest path; ranking paths

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C29: Multi-objective and goal programming

Related Items

Optimal paths in bi-attribute networks with fractional cost functions

Cites Work

• On a multicriteria shortest 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
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• An algorithm for the quickest path problem
• An empirical investigation of some bicriterion shortest path algorithms
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• On a routing problem
• Shortest-path algorithms: Taxonomy and annotation
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Deterministic network optimization: A bibliography
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• Label correcting methods to solve multicriteria shortest path problems