Knapsack Problem with Limitations II
pub use competitive::combinatorial_optimization::ZeroOneKnapsackPloblemBranchAndBound;