#TITLE_ALTERNATIVE#
Abstract: <br /> <br /> <br /> <br /> <br /> A network is a type of directed graphs with two distinguished vertices, a source and a sink. Every arch on a network has a weight, which is called capacity. In <br /> <br /> <br /> <br /> <...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/5909 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:5909 |
|---|---|
| spelling |
id-itb.:59092017-09-27T11:43:02Z#TITLE_ALTERNATIVE# Chan (NIM: 101 000 38), Danny Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/5909 Abstract: <br /> <br /> <br /> <br /> <br /> A network is a type of directed graphs with two distinguished vertices, a source and a sink. Every arch on a network has a weight, which is called capacity. In <br /> <br /> <br /> <br /> <br /> network we are interested in finding a maximum flow from the source to the sink. <br /> <br /> <br /> <br /> <br /> The Ford Fulkerson algorithm can be used to find a maximum flow in a network. In this final project we study scheduling problem in high schools. A network is <br /> <br /> <br /> <br /> <br /> constructed so that it can represent the scheduling problem. A maximum flow obtained on this network represents a school timetable. <br /> <br /> <br /> <br /> <br /> As a part of this final project, we build a computer program to generate school timetables. This program is constructed based on the Ford Fulkerson algorithm. <br /> text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
Abstract: <br />
<br />
<br />
<br />
<br />
A network is a type of directed graphs with two distinguished vertices, a source and a sink. Every arch on a network has a weight, which is called capacity. In <br />
<br />
<br />
<br />
<br />
network we are interested in finding a maximum flow from the source to the sink. <br />
<br />
<br />
<br />
<br />
The Ford Fulkerson algorithm can be used to find a maximum flow in a network. In this final project we study scheduling problem in high schools. A network is <br />
<br />
<br />
<br />
<br />
constructed so that it can represent the scheduling problem. A maximum flow obtained on this network represents a school timetable. <br />
<br />
<br />
<br />
<br />
As a part of this final project, we build a computer program to generate school timetables. This program is constructed based on the Ford Fulkerson algorithm. <br />
|
| format |
Final Project |
| author |
Chan (NIM: 101 000 38), Danny |
| spellingShingle |
Chan (NIM: 101 000 38), Danny #TITLE_ALTERNATIVE# |
| author_facet |
Chan (NIM: 101 000 38), Danny |
| author_sort |
Chan (NIM: 101 000 38), Danny |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/5909 |
| _version_ |
1820663781741559808 |