0-1 Programming Menentukan Shortest  Path yang Memenuhi Kendala

dc.contributor.advisor	Harahap, Marwan
dc.contributor.advisor	Sitorus, Syahriol
dc.contributor.author	Sari, Astri Wulan
dc.date.accessioned	2022-12-21T07:26:01Z
dc.date.available	2022-12-21T07:26:01Z
dc.date.issued	2009
dc.identifier.uri	https://repositori.usu.ac.id/handle/123456789/76249
dc.description.abstract	This article studies about applying of 0-1 Programmings in looking for a shortest path constraint which is problem knapsack in the network. Problem that is often emerges in this network for example to look for shortest path with cost constraint which has been budgeted from source of s to purpose t. At this problem optimal solution will show possibility that best choice and implementation by a program using LINDO.	en_US
dc.language.iso	id	en_US
dc.publisher	Universitas Sumatera Utara	en_US
dc.title	0-1 Programming Menentukan Shortest Path yang Memenuhi Kendala	en_US
dc.type	Thesis	en_US
dc.identifier.nim	NIM060823012
dc.identifier.nidn	NIDN0025124602
dc.identifier.nidn	NIDN0010037104
dc.identifier.kodeprodi	KODEPRODI44201#Matematika
dc.description.pages	74 Halaman	en_US
dc.description.type	Skripsi Sarjana	en_US