23 March 2019

MATA KULIAH UBHARA SURABAYA

SAP, SILABI, KURIKULUM, GBBP, MODUL

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

January 7, 2013 by   Leave a comment

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 capacity or volume limits without exceeding the maximum capacity of containers that have been determined. The types of knapsack that has been discussed so far is only to maximize the use not to exceed the limits specified capacity so it cannot be applied to the problem. This study aims to develop a dynamic programming algorithm to solve the MinMax 0/1 knapsack, which is an extension of the 0/1 knapsack with minimal and maximal constraints. The result of study showed that the solution of the MinMax 0/1 knapsack problem using dynamic programming can be used to generate the optimal solution to the problem of loading goods into the container such that the minimum and maximum capacity constraints are met.

PDF FILE

Leave a Reply