Metode Balas dalam Penyelesaian Model Knapsack

Abstract

Limited container or places that can used for choose many things that will bring is principal attention for distribution case, backpack, or else from many things that should distributed or in , that each of things have different weight and price. The set of problems called Knapsack Problem. For this 0-1 problem, many Methods or Algorithm can be used. One of them called Algorithm or Balas Method. Which this Method used for 0-1 Problem with trail step without have to make enumeration explicit. The purpose of this research for get maximum profit from the choosen things.