Optimal paths in bi-attribute networks with fractional cost functions

DOI10.1016/j.ejor.2007.06.048zbMath1144.90327OpenAlexW1963664681MaRDI QIDQ928022

Hossein Soroush

Publication date: 11 June 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.048

zbMATH Keywords

networksoptimal pathroutingfractional/rational functions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (1)

Multicriteria path and tree problems: discussion on exact algorithms and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Routing with nonlinear multiattribute cost functions
• On a multicriteria shortest path problem
• On a special class of bicriterion path problems
• A parametric approach to solving bicriterion shortest path problems
• Generalized dynamic programming for multicriteria optimization
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• The shortest path problem with two objective functions
• Optimal paths in probabilistic networks: A case with temporary preferences
• Minimum cost-reliability ratio path problem
• A bicriterion shortest path algorithm
• A multicriteria Pareto-optimal path algorithm
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• An interactive procedure using domination cones for bicriterion shortest path problems
• An algorithm for the quickest path problem
• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• A label correcting approach for solving bicriterion shortest-path problems
• 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
• Shortest-path algorithms: Taxonomy and annotation
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Combinatorial Optimization with Rational Objective Functions
• A simple and fast label correcting algorithm for shortest paths
• Low Probability—High Consequence Considerations in Routing Hazardous Material Shipments
• The determination of the path with minimum-cost norm value
• A bicriterion approach for routing problems in multimedia networks
• An algorithm to determine a path with minimal cost/capacity ratio

This page was built for publication: Optimal paths in bi-attribute networks with fractional cost functions