Network problems & algorythms

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2532

Full metadata record

DC Field	Value	Language
dc.contributor.author	Djannaty, F	-
dc.contributor.author	Dowman, KD	-
dc.coverage.spatial	36	en
dc.date.accessioned	2008-07-24T13:27:27Z	-
dc.date.available	2008-07-24T13:27:27Z	-
dc.date.issued	1994	-
dc.identifier.citation	Maths Technical Papers (Brunel University). 1994, pp 1-29	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2532	-
dc.description.abstract	Special structure linear programming problems have received considerable attention during the last two decades and among them network problems are of particular importance and have found numerous applications in manage- ment science and technology. The mathematical models of the shortest route, maximal flow, and pure minimum cost flow problems are presented and various interrelationships among them are investigated. Finally three algorithms due to Dijkstra and Ford and Fulkerson which deal with the solution of the above three network problems are discussed.	en
dc.format.extent	296749 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Brunel University	en
dc.relation.ispartof	Brunel University Mathematics Technical Papers collection;	-
dc.relation.ispartofseries	;TR/01/94	-
dc.title	Network problems & algorythms	en
dc.type	Research Paper	en
Appears in Collections:	Dept of Mathematics Research Papers Mathematical Sciences

Files in This Item:

File	Description	Size	Format
TR_01_94.pdf		289.79 kB	Adobe PDF	View/Open