New algorithms for multi objective shortest path problem.

DOI10.1007/BF03398701zbMath1210.90169OpenAlexW2772465513MaRDI QIDQ2477107

T. N. Janakiraman, S. Ismail Mohideen, V. Narsimha Sastry

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398701

Mathematics Subject Classification ID

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

Related Items (5)

Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Shortest paths in networks with vector weights
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• Modified algorithm to compute Pareto-optimal vectors
• Shortest Path Algorithms: An Evaluation Using Real Road Networks
• On a routing problem
• Shortest-path algorithms: Taxonomy and annotation
• An Appraisal of Some Shortest-Path Algorithms
• An algorithm for finding shortest routes from all source nodes to a given destination in general networks

This page was built for publication: New algorithms for multi objective shortest path problem.