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
Knapsack problem (KSP)
\qquad \sum_{i=1}^n v_ix_i \to max
subject to
\qquad \sum_{i=1}^n w_ix_i \leqslant W, \quad \quad x_i \in \{0,1,\ldots,c_i\}

(our software can involve several limits, e.g. cost -> max wrt total volume < V, total mass < M)

(since v 0.51) OpenOpt KSP examples:

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:

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