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

MaRDI QIDQ3224329zbMATHFDO

Authors Amit Kumar, Manjot Kaur

Publication date 30 March 2012

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

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)

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

Cited in

(4)

• Shortest path problem on a network with imprecise edge weight
• 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
• A new algorithm for minimum path in a network

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)