Optimal paths in bi-attribute networks with fractional cost functions

DOI10.1016/J.EJOR.2007.06.048zbMATH1144.90327OpenAlexW1963664681MaRDI QIDQ928022FDOQ928022

Authors Hossein M. 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

networksroutingoptimal pathfractional/rational functions

Mathematics Subject Classification ID

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

Recommendations

• The optimal path problem in a bi-attribute network with fractional objective function
• Routing with nonlinear multiattribute cost functions
• scientific article; zbMATH DE number 1086979
• Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
• scientific article; zbMATH DE number 792650

Cites work

• scientific article; zbMATH DE number 3819489 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 3726107 (Why is no real title available?)
• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3334757 (Why is no real title available?)
• A bicriterion approach for routing problems in multimedia networks
• A bicriterion shortest path algorithm
• A label correcting approach for solving bicriterion shortest-path problems
• A multicriteria Pareto-optimal path algorithm
• A note on two problems in connexion with graphs
• A parametric approach to solving bicriterion shortest path problems
• A simple and fast label correcting algorithm for shortest paths
• An algorithm for the quickest path problem
• An algorithm to determine a path with minimal cost/capacity ratio
• 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
• An interactive procedure using domination cones for bicriterion shortest path problems
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Combinatorial Optimization with Rational Objective Functions
• Generalized dynamic programming for multicriteria optimization
• Low Probability—High Consequence Considerations in Routing Hazardous Material Shipments
• Minimum cost-reliability ratio path problem
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• On a multicriteria shortest path problem
• On a special class of bicriterion path problems
• Optimal paths in probabilistic networks: A case with temporary preferences
• Routing with nonlinear multiattribute cost functions
• 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 determination of the path with minimum-cost norm value
• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• The shortest path problem with two objective functions

Cited in

(3)

• Multicriteria path and tree problems: discussion on exact algorithms and applications
• The optimal path problem in a bi-attribute network with fractional objective function
• Routing with nonlinear multiattribute cost functions

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

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