OPTIMASI STRATEGI ALGORITMA GREEDY UNTUK MENYELESAIKAN PERMASALAHAN KNAPSACK 0-1

Paryati Paryati

Abstract


Knapsack is a place used to store an object with same or less size with its capacity. The objects can be put at entirely or partially. This analysis using knapsack 0 or 1, that is an object taken entirely or not at all. As for the profit value is benefit value that possessed by every object. In this analysis, we always expect optimal profit value from an object. But, more object doesn’t always mean more profit.


References


Brassard G, 1996, Fundamentals of algorithmics, Prentice-Hall, New Jersey

Ding-Zhu Du, 2000, Theory of Computational Complexity, John Wiley & Son

Jogiyanto H, 1993, Konsep Dasar Pemrograman Bahasa C, Andi Offset, Yogyakarta

Pressman R, 2002, Software Enfineering, Prentice-Hall, Inc., New Jersey

Springer V, 2005, Knapsack 0-1 Problem, John Wiley & Sons, ISBN : 3-540-40286-1

Silvano et al, 1990, Knapsack problem : Algorithm and Computer Implementation, John Wiley & Sons, ISBN : 0-471-92420

Yuliani I, 2004, Knapsack 0-1 Problem Diselesaikan Menggunakan Algoritma Genetic, Tesis S-2 UGM


Refbacks

  • There are currently no refbacks.