knapsack-problems
CommunityOptimize resource allocation with knapsack solutions.
Data & Analytics#optimization#resource allocation#knapsack#dynamic programming#operations research#greedy algorithm
Authorkishorkukreja
Version1.0.0
Installs0
System Documentation
What problem does it solve?
This Skill helps you solve complex optimization problems where you need to select a subset of items to maximize value within given constraints, such as weight or volume limits.
Core Features & Use Cases
- Problem Variants: Solves 0/1, Bounded, Unbounded, Multidimensional, and Multiple Knapsack problems.
- Algorithm Options: Offers Dynamic Programming, Branch and Bound, and Greedy approximations.
- Use Case: A logistics company needs to load a truck with the most valuable combination of goods, given the truck's weight and volume capacity. This Skill can determine the optimal selection of items.
Quick Start
Use the knapsack-problems skill to solve a 0/1 knapsack problem with a capacity of 50, given item values [60, 100, 120] and weights [10, 20, 30].
Dependency Matrix
Required Modules
pulp
Components
scriptsreferences
💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: knapsack-problems Download link: https://github.com/kishorkukreja/awesome-supply-chain/archive/main.zip#knapsack-problems Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.