Jump to content

Constrained minimization problem


sthor69

Recommended Posts

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.

 
Link to comment
Share on other sites

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

Link to comment
Share on other sites

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 account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.