sthor69 Posted October 26, 2017 Posted October 26, 2017 I just posted this problem in the wrong forum (Computer Help). I think this is the better forum for this question. Sorry for the duplication... In the following problem, which algorithm should be considered? Having a finite set of variable height brikcs, how can I find the subset that can reach at least a given height, minimizing the total height of the chosen bricks? In other words, which bricks should I use to reach a given height minimizing cost of material? Thanks.
fiveworlds Posted October 26, 2017 Posted October 26, 2017 What bin packing algorithms have you studied??
sthor69 Posted October 31, 2017 Author Posted October 31, 2017 bin packing algorithms maximize the number of items given the constraint in the sum of volumes. In may case you have to minimize the sum of volumes, constrained it is more than a given value. It's not so different, but I cannot get how to pass from one problem to the other
fiveworlds Posted October 31, 2017 Posted October 31, 2017 Quote bin packing algorithms maximize the number of items given the constraint in the sum of volumes. It is basically a knapsack problem only you are minimizing the cost. Which should just require changing > to < https://en.wikipedia.org/wiki/Knapsack_problem
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now