Home Install Documentation Problems Tree Applications Forum

Increase your income
via IT outsourcing!
Ukrainian HI-TECH Initiative Ukrainian HI-TECH Initiative


From OpenOpt

Jump to: navigation, search
Bin Packing problem (BPP)
minimize  B = \sum_{i=1}^n y_i
subject to \sum_{j=1}^n a_j x_{ij} \leq V y_i, \forall i \in \{1,\ldots,n\}
\sum_{i=1}^n x_{ij} = 1, \forall j \in \{1,\ldots,n\}
 y_i \in \{0,1\}, \forall i \in \{1,\ldots,n\}
 x_{ij} \in \{0,1\}, \forall i \in \{1,\ldots,n\} \, \forall j \in \{1,\ldots,n\}

(our software can involve several limits, e.g. volume < V, mass < M)

(since v 0.51) OpenOpt BPP examples:

Attention 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:

Future Plans include

  • Bins of different types (limited by numbers)

See also:

Made by Dmitrey
Retrieved from "http://openopt.org/BPP"
Personal tools
Latest OOSuite 0.5605