# Tag Archives: knapsack

## Check if all people can vote on two machinesFebruary 19, 2017

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 »

## Unbounded Knapsack (Repetition of items allowed)January 16, 2017

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 »

## A Space Optimized DP solution for 0-1 Knapsack ProblemAugust 31, 2016

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 »

## Branch and Bound | Set 2 (Implementation of 0/1 Knapsack)April 29, 2016

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 | Set 1 (Introduction with 0/1 Knapsack)April 27, 2016

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 »

## Fractional Knapsack ProblemMarch 23, 2016

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

## Dynamic Programming | Set 10 ( 0-1 Knapsack Problem)March 19, 2012

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.