Solver Max logo

Multi-constrained, multi-knapsack problem in OR-Tools

Key features of this model:

  • Description: Select items to include in multiple knapsacks, given multiple attributes of each item.
  • Category: Knapsack.
  • Type: MILP.
  • Library: OR-Tools.
  • Solver: SCIP.

This notebook is based on an example by Google. Key differences are:

  • The number of attributes is expanded from one to three.
  • The variables are defined as integer (0, 1) rather than Boolean, though the result is the same.
  • Google's example solves the model using two methods: SCIP MIP solver and CP-SAT solver.

GitHub: Multi-constrained, multi-knapsack problem in OR-Tools.