problem: we have one object have two attribute: a and b and one box can hold N attribute a and M attribute b. now we have k objects and every object a and b

ask: how many boxes we need to hold the k objects using minimum boxes ?

packing problem

https://developers.google.com/optimization/pack/bin_packing

reference

• google or-tools
• packing problem
• knapsack problem
• leetcode 1986