pykp.solvers

This module contains implementations of various solvers for the knapsack problem.

Modules

branch_and_bound(items, capacity)	Solves the knapsack problem using the branch-and-bound algorithm.
greedy(items, capacity)	Solves the knapsack problem using the greedy algorithm.
mzn_gecode(items, capacity)	Solves the knapsack problem using the minizinc and gecode solver.