Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/2532
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDjannaty, F-
dc.contributor.authorDowman, KD-
dc.coverage.spatial36en
dc.date.accessioned2008-07-24T13:27:27Z-
dc.date.available2008-07-24T13:27:27Z-
dc.date.issued1994-
dc.identifier.citationMaths Technical Papers (Brunel University). 1994, pp 1-29en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/2532-
dc.description.abstractSpecial 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.extent296749 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherBrunel Universityen
dc.relation.ispartofBrunel University Mathematics Technical Papers collection;-
dc.relation.ispartofseries;TR/01/94-
dc.titleNetwork problems & algorythmsen
dc.typeResearch Paperen
Appears in Collections:Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
TR_01_94.pdf289.79 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.