Skip to content

Solution to a Data Science challenge involving an enriched Knapsack-like problem (optimal allocation of items of different size and weight into containers of different capacity)

Notifications You must be signed in to change notification settings

achiappo/Knapsack-datascience-challenge

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Knapsack challenge

Solution to an enriched Knapsack-like problem

Problem statement

Efficient Allocation

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.

Boxes characteristics:

• 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)

About

Solution to a Data Science challenge involving an enriched Knapsack-like problem (optimal allocation of items of different size and weight into containers of different capacity)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published