??? 12/16/09 17:49 Read: times |
#171670 - You cannot well...maybe not Responding to: ???'s previous message |
The small bottle is 2/3 of the size of the large bottles. My problem is this, the bad bottles come down the line at ramdom sizes. Not real good with math. How can I determine how to fill the box with not over filling the box.
Its the knapsack filling problem and it's known to be NP complete, there is no known method of solving it which is better than guessing.If you do find a way of solving the problem then you have found a way of solving all NP-complete problems and your Nobel prize is in the post. |
Topic | Author | Date |
8052 keeping track of broken bottles. | 01/01/70 00:00 | |
Sensors? | 01/01/70 00:00 | |
Start from either side, if having box with mixed bottle size | 01/01/70 00:00 | |
Just assign a volume to each bottle. | 01/01/70 00:00 | |
Hard objects needs extra rules | 01/01/70 00:00 | |
The maths should not be very accurate. | 01/01/70 00:00 | |
I cannot believe that this was ever a serious question. | 01/01/70 00:00 | |
Let`s say | 01/01/70 00:00 | |
I did something similar once and ... | 01/01/70 00:00 | |
Takes discipline | 01/01/70 00:00 | |
If the bottles are already broken... | 01/01/70 00:00 | |
8052 keeping track of broken bottles | 01/01/70 00:00 | |
???!! | 01/01/70 00:00 | |
You cannot well...maybe not | 01/01/70 00:00 | |
It's easy | 01/01/70 00:00 | |
Brute force | 01/01/70 00:00 | |
you mean cut them off as a "common denominator"? | 01/01/70 00:00 | |
Kind of | 01/01/70 00:00 | |
There's no Nobel Prize for math ... sigh ... | 01/01/70 00:00 | |
8052 keeping track of broken bottles | 01/01/70 00:00 | |
Ehh??? | 01/01/70 00:00 | |
Different methods for different problems![]() | 01/01/70 00:00 |