KSP
From OpenOpt
Knapsack problem (KSP)
- subject to
(our software can involve several limits, e.g. cost -> max wrt total volume < V, total mass < M)
(since v 0.51) OpenOpt KSP examples:
- simplest, single constraint (volume)
- advanced, several constraints
- multiobjective, possibly nonlinear
Available solvers:
- interalg - pro: BSD license; cons: Python code with some slow parts (probably will be inhanced by PyPy); focused on non-linear problems and thus MILP solvers work better.
- MILP solvers
Future Plans include
- Multiple knapsack problem
See also:
- BPP (bin packing problem)
- STAB (graph maximum stable set)
- MCP (maximum clique problem)
- TSP (traveling salesman problem)
- Knapsack problem in wikipedia
Made by Dmitrey |