Formulasi TSP (Traveling Salesman Problem) menggunakan ILP (Integer Linear Programming)

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Cahyadi
dc.date.accessioned	2011-09-09T07:46:59Z
dc.date.available	2011-09-09T07:46:59Z
dc.date.issued	2008
dc.identifier.uri	http://repository.ipb.ac.id/handle/123456789/50079
dc.description.abstract	TSP is a journey of salesman f?om his origin town (place) to visit n-cities (places) only at once, then return to his origin town (place) with a minimum total distance. Its purpose is to minimize the operating expense that is released by the company. Vehicle route at TSP in the form of a Hamiltonian cycle, that is closed path containing all nodes at the graph which representing a network walk. Its problem is to determine a journey route which is feasible (possibly can be passed by) in such a way the vehicle travelled distance passed the route is minimum.	en
dc.publisher	IPB (Bogor Agricultural University)
dc.subject	Bogor Agricultural University (IPB)	en
dc.title	Formulasi TSP (Traveling Salesman Problem) menggunakan ILP (Integer Linear Programming)	en
Appears in Collections:	UT - Mathematics

Files in This Item:

File	Description	Size	Format
G08cah.pdf Restricted Access	Full Text	1.07 MB	Adobe PDF	View/Open

DSpace JSPUI