25 June 2019

MATA KULIAH UBHARA SURABAYA

SAP, SILABI, KURIKULUM, GBBP, MODUL

Posts Tagged ‘Optimal Solution Of Minmax 0/1’

Optimal Solution Of Minmax 0/1 Knapsack Problem Using Dynamic Programming»

January 7, 2013 by   Filed under Jurnal-Teknik, Teknik

International Journal of Informatics and Communication Technology (IJ-ICT) Vol.2, No. 1, January 2013, pp. 9~16 ISSN: 2252-8776 ABSTRACT Knapsack problem is a problem that occurs when looking for optimal selection of objects that will be put into a container with limited space and capacity. On the issue of loading goods into the container, optimal selection of objects or items to be sent must fulfilled to minimize the total weight of the... Optimal Solution Of Minmax 0/1 Knapsack Problem Using Dynamic Programming