Penyelesaian Permainan Flow Colors dengan Meminimumkan Deviasi Panjang Tiap Jalur

Please use this identifier to cite or link to this item: http://repository.ipb.ac.id/handle/123456789/69904

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Aman, Amril
dc.contributor.advisor	Hanum, Farida
dc.contributor.author	Chahyadi, Irfan
dc.date.accessioned	2014-10-29T06:43:05Z
dc.date.available	2014-10-29T06:43:05Z
dc.date.issued	2014
dc.identifier.uri	http://repository.ipb.ac.id/handle/123456789/69904
dc.description.abstract	Flow Colors is a puzzle game, where players must connect every pair of points of the same color with a pipe so that the pipes cover all the game areas with colors. Pipes with different colors should not be intersected/ overlapped. This problem can be modelled as a problem of making routes on a graph which is a modification of Traveling Salesman Problem (TSP). This study presents how to formulate puzzle of Flow Colors to minimize length deviation of the lines represented by the pipes by applying method of integer linear programming and solving it by using LINGO 11.0 computer software.	en
dc.language.iso	id
dc.subject.ddc	mathematics	en
dc.title	Penyelesaian Permainan Flow Colors dengan Meminimumkan Deviasi Panjang Tiap Jalur	en
dc.subject.keyword	Traveling Salesman Problem	en
dc.subject.keyword	puzzle Flow Colors	en
dc.subject.keyword	integer linear programming	en
Appears in Collections:	UT - Mathematics

Files in This Item:

File	Description	Size	Format
G14ich.pdf Restricted Access	full text	10.93 MB	Adobe PDF	View/Open

DSpace JSPUI