## Unbounded Fractional Knapsack

Given weights and values of n items, the task is to put these items in a knapsack of capacity W to get the maximum total… Read More »

Given weights and values of n items, the task is to put these items in a knapsack of capacity W to get the maximum total… Read More »

A trip to mystical land is going to be organized in ByteLand, the city of Bytes. Unfortunately, there are limited seats say A and there… Read More »

Given an integer array W[] consisting of weights of items and ‘K’ knapsacks of capacity ‘C’, find maximum weight we can put in the knapsacks… Read More »

Given an integer array W[] consisting of weights of the items and some queries consisting of capacity C of knapsack, for each query find maximum… Read More »

Given three integer n, h and p where n is the number of topics, h is the time left (in hours) and p is the… Read More »

Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack.… Read More »

There are n people and two identical voting machines. We are also given an array a[] of size n such that a[i] stores time required… Read More »

Given a knapsack weight W and a set of n items with certain value vali and weight wti, we need to calculate minimum amount that… Read More »

Given the weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the… Read More »

We strongly recommend to refer below post as a prerequisite for this. Branch and Bound | Set 1 (Introduction with 0/1 Knapsack) We discussed different… Read More »

Branch and bound is an algorithm design paradigm which is generally used for solving combinatorial optimization problems. These problems typically exponential in terms of time… Read More »

Given weights and values of n items, we need to put these items in a knapsack of capacity W to get the maximum total value… Read More »