Jump to content

Constrained minimization problem

sthor69
in Computer Science

Featured Replies

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.

 
  • Author

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

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

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.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.