A GRAPH THEORTICAL APPROACH FOR FINDING THE SHORTEST  PATH AND CRITICAL PATH IN PROJECT NETWORKS WITH IMPRECISE INFORMATION

dc.contributor.author	HABTAMU WORKU
dc.date.accessioned	2018-01-10T06:49:05Z
dc.date.available	2018-01-10T06:49:05Z
dc.date.issued	2017-10
dc.identifier.uri	http://hdl.handle.net/123456789/796
dc.description.abstract	Finding the shortest path and a critical path in a project network with the uncertain data is being researched using different approach.In this study we have developed a method for finding the shortest path and a critical path in a project network using a graph theoretical approach when the data about the activities of the network are uncertain, that is when they are represented by fuzzy numbers.	en_US
dc.language.iso	en	en_US
dc.publisher	ARBAMINCH UNIVERSITY	en_US
dc.title	A GRAPH THEORTICAL APPROACH FOR FINDING THE SHORTEST PATH AND CRITICAL PATH IN PROJECT NETWORKS WITH IMPRECISE INFORMATION	en_US
dc.type	Thesis	en_US