BPP
From OpenOpt
Bin Packing problem (BPP)
minimize | ||
subject to | ||
(our software can involve several limits, e.g. volume < V, mass < M)
(since v 0.51) OpenOpt BPP examples:
Providing bins parameter "n" as a number of available bins or (better) a good estimation of optimal value (no less than the value) can essentially speedup computations
Available solvers:
- MILP solvers
Future Plans include
- Bins of different types (limited by numbers)
See also:
- KSP (knapsack problem)
- STAB (graph maximum stable set)
- MCP (maximum clique problem)
- TSP (traveling salesman problem)
- Bin packing problem in wikipedia
Made by Dmitrey |