The determination of the path with minimum-cost norm value

DOI10.1002/NET.10077MaRDI QIDQ4419275zbMATH OpenOpenAlexFDO

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

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 relationmultiobjective shortest pathranking paths

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• The shortest path problem with two objective functions
• On a multicriteria shortest path problem
• scientific article; zbMATH DE number 6161596
• A multi-objective shortest path problem
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms

Cites work

• A bicriterion shortest path algorithm
• An algorithm for the quickest path problem
• An empirical investigation of some bicriterion shortest path algorithms
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• 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
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• On a multicriteria shortest path problem
• On a routing problem
• Shortest-path algorithms: Taxonomy and annotation
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• The shortest path problem with two objective functions

Cited in

(7)

• Path-value functions for which Dijkstra's algorithm returns optimal mapping
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• An algorithm to determine a path with minimal cost/capacity ratio
• Optimal paths in bi-attribute networks with fractional cost functions

This page was built for publication: The determination of the path with minimum-cost norm value

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419275)