Knapsack Problem (0-1) Menggunakan Metode Pendekatan Dynamic Programming (DP) vs Recursion By Brute-Force Algorithm Or Exhaustive Search

Akar, Genesis (2023) Knapsack Problem (0-1) Menggunakan Metode Pendekatan Dynamic Programming (DP) vs Recursion By Brute-Force Algorithm Or Exhaustive Search. Skripsi thesis, Sanata Dharma University.

	Text (Full) 195314008_full.pdf Restricted to Registered users only Download (1MB)
	Text (Abstract) 195314008.pdf Download (155kB)

Item Type:	Thesis (Skripsi)
Subjects:	T Technology > TB Information Technology
Divisions:	Faculty of Science and Technology > Department of Informatics Engineering
Depositing User:	Maria Yovita Qwartiti
Date Deposited:	09 Aug 2023 02:26
Last Modified:	09 Aug 2023 02:26
URI:	http://repository.usd.ac.id/id/eprint/47770

Actions (login required)

View Item

USD Repository is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.