The multiple-choice p-dimensional vector bin packing problem is a variant of vector packing in which bins have several types (i.e., sizes and costs) and items have several incarnations (i.e., will take one of several possible sizes).
The MIP models are being solved using COIN-OR CBC (an open-source MIP solver) on a Raspberry Pi 3 Model B. Much better run times can be achieved using Gurobi or CPLEX.
By means of reductions to vector packing, VPSolver can be used to solve several problems such as:
By means of reductions to multiple-choice vector packing, VPSolver can be used to solve several problems such as:
VPSolver includes a python interface that allows modeling other problems easily. Using the python interface, VPSolver can be used to solve problems such as:
Note: Suggestions of other cutting & packing problems (including industrial applications) are welcome! [Contact]