✨ feat(integerValuesKnapsackUnbounded): First draft.

Author: make-github-pseudonymous-again

src/index.js

@@ -1,18 +1,21 @@
 import integerValuesKnapsack from './integerValuesKnapsack';
+import integerValuesKnapsackUnbounded from './integerValuesKnapsackUnbounded';
 import integerWeightsKnapsack from './integerWeightsKnapsack';
 import integerWeightsKnapsackUnbounded from './integerWeightsKnapsackUnbounded';
 import knapsackApprox from './knapsackApprox';
 
 /* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
 export default {
 	integerValuesKnapsack,
+	integerValuesKnapsackUnbounded,
 	integerWeightsKnapsack,
 	integerWeightsKnapsackUnbounded,
 	knapsackApprox,
 };
 
 export {
 	integerValuesKnapsack,
+	integerValuesKnapsackUnbounded,
 	integerWeightsKnapsack,
 	integerWeightsKnapsackUnbounded,
 	knapsackApprox,

src/integerValuesKnapsackUnbounded.js

@@ -0,0 +1,47 @@
+import assert from 'assert';
+import {increasing} from '@aureooms/js-compare';
+import {max, map, range} from '@aureooms/js-itertools';
+
+const integerValuesKnapsackUnbounded = (
+	v,
+	w,
+	n,
+	W,
+	V = Math.floor(
+		W *
+			max(
+				increasing,
+				map((i) => v[i] / w[i], range(n)),
+			),
+	),
+	m = new w.constructor(V + 1).fill(W + 1),
+) => {
+	assert(v.length === n);
+	assert(w.length === n);
+	assert(Number.isInteger(V) && V >= 0);
+	assert(m.length >= V + 1);
+	m[0] = 0;
+	for (let j = 1; j <= V; ++j) {
+		let temporary = m[j];
+		for (let i = 0; i < n; ++i) {
+			const wi = w[i];
+			const vi = v[i];
+			assert(Number.isInteger(vi) && vi >= 0);
+			const k = j - vi;
+			// TODO sort by value to avoid branching
+			// from larger to smaller so that m is scanned
+			// from left to right
+			if (k >= 0) temporary = Math.min(temporary, m[k] + wi);
+		}
+
+		m[j] = temporary;
+	}
+
+	for (let j = V; j > 0; --j) {
+		if (m[j] <= W) return j;
+	}
+
+	return 0;
+};
+
+export default integerValuesKnapsackUnbounded;

test/src/unbounded-knapsack-problem.js

@@ -2,7 +2,10 @@ import test from 'ava';
 
 import {all, map} from '@aureooms/js-itertools';
 
-import {integerWeightsKnapsackUnbounded} from '../../src';
+import {
+	integerValuesKnapsackUnbounded,
+	integerWeightsKnapsackUnbounded,
+} from '../../src';
 
 const macro = (t, solve, _name, v, w, n, W, opt, approx) => {
 	t.is(n, v.length);
@@ -27,6 +30,10 @@ macro.title = (title, solve, name, v, w, n, W, opt, approx) =>
 		  )}, ${n}, ${W}) >= ${approx} * ${opt}`;
 
 const solvers = [
+	{
+		solve: integerValuesKnapsackUnbounded,
+		hypothesis: (v) => all(map((x) => Number.isInteger(x), v)),
+	},
 	{
 		solve: integerWeightsKnapsackUnbounded,
 		hypothesis: (_, w) => all(map((x) => Number.isInteger(x), w)),