Download now Free registration required
This paper attempt to make decision on the best way a division can allocate teams to contractors, both experience and inexperience. The contractors will consecutively be assigned to their district to handle some public Work. All of these need to be achieved at the cheapest possible way. With these in mind, graph theory was employed in designing a network flow to model the problem. The model was validated with some random cost of allocating contractors to public work. The model was solved using the Hungarian Method, an assignment problem solution algorithm. The solution was implemented with java programming language.
- Format: PDF
- Size: 698.1 KB