A new algorithm for solving shortest path problem on a network with imprecise edge weight

zbMATH Open1235.90173MaRDI QIDQ3224329FDOQ3224329

Authors: Amit Kumar, Manjot Kaur 

Publication date: 30 March 2012

Full work available at URL: http://www.pvamu.edu/pages/7659.asp

Recommendations

• Shortest path problem on a network with imprecise edge weight
• A new algorithm for minimum path in a network
• scientific article; zbMATH DE number 5186430
• Solving the fuzzy shortest path problem on networks by a new algorithm
• Fuzzy shortest path problem based on index ranking

zbMATH Keywords

triangular fuzzy numbersranking functioninterval numbersfuzzy shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Fractional graph theory, fuzzy graph theory (05C72)

Cited In (4)

• A new algorithm for minimum path in a network
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• An acceptability index based approach for solving shortest path problem on a network with interval weights
• Shortest path problem on a network with imprecise edge weight

This page was built for publication: A new algorithm for solving shortest path problem on a network with imprecise edge weight

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