The ford fulkerson algorithm on a case study of the dissertation scheduling problem
Scheduling problem are often hard and time consuming to solve. It is considered as one of the most difficult problem. Therefore, the development of a network model for timetabling problem is necessary to solve the problem by determining the maximum flow in the network. The purpose of this study is t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/33176/1/RajaNadiahBintiRajaMohdNazirMFS2013.pdf http://eprints.utm.my/id/eprint/33176/ http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:82497?queryType=vitalDismax&query=+The+ford+fulkerson+algorithm+on+a+case+study+of+the+dissertation+scheduling+problem&public=true |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
http://eprints.utm.my/id/eprint/33176/1/RajaNadiahBintiRajaMohdNazirMFS2013.pdfhttp://eprints.utm.my/id/eprint/33176/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:82497?queryType=vitalDismax&query=+The+ford+fulkerson+algorithm+on+a+case+study+of+the+dissertation+scheduling+problem&public=true