I have a Box with some dimension length, width, height.
I have items with different length, width, height.
Is there an existing algorithm that can determine the best items to use to put inside the box?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have a Box with some dimension length, width, height.
I have items with different length, width, height.
Is there an existing algorithm that can determine the best items to use to put inside the box?
This is called a Bin Packing/Cutting Stock/Knapsack problem, and it is NP hard. In general you can only get an approximate solution by using heuristics, see for example
http://en.wikipedia.org/wiki/Knapsack_problem
http://en.wikipedia.org/wiki/Bin_packing_problem
http://en.wikipedia.org/wiki/Cutting_stock_problem