OPTIMASI STRATEGI ALGORITMA GREEDY UNTUK MENYELESAIKAN PERMASALAHAN KNAPSACK 0-1

Paryati, Paryati (2011) OPTIMASI STRATEGI ALGORITMA GREEDY UNTUK MENYELESAIKAN PERMASALAHAN KNAPSACK 0-1. Telematika (13). ISSN 1979-2328

[img]
Preview
PDF (Tugas Kusus) - Draft Version
Available under License Creative Commons Attribution.

Download (183Kb) | Preview

    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.

    Item Type: Article
    Subjects: 000 Komputer, Informasi, dan Referensi Umum
    600 Teknologi
    Divisions: Fakultas Teknologi Industri > Teknik Informatika
    Depositing User: Kontributor Telematika 1
    Date Deposited: 29 May 2011 10:28
    Last Modified: 29 May 2011 10:28
    URI: http://repository.upnyk.ac.id/id/eprint/215

    Actions (login required)

    View Item