Filling 10 backpacks with 20 different size boxes might seem a common
task but different variables have to be considered to achieve this.
Determine the best approach to obtain an efficient allocation of 20 boxes into 10 backpacks.
• Boxex have different size and value
• Boxes have different timing label
• Boxes have either type A or type B label
• Backpacks have different capacity
(see the file challenge_statement.pdf for a detailed complete problem statement)