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 bundles of objects different size ( lot of objects can have same size, example: I have 54 object of 6B, 76 of 10B, 79 of 24B etc.
The size of the objects are 6, 8 ,10 …. bytes ). I need to pack that bundle in couple messages ( each message has maximum length 256 bytes).
Problem is how to get the solution with the minimum number of messages?
Is there any known algorithm for this? Do I need Hopfield neural network for this?
This is an example of the bin packing problem which is a combinatorial NP-hard problem. The simplest algorithm is “First Fit Decreasing (FFD)” in which you would first sort your objects by decreasing size, and then insert each object into the first message in the list with sufficient remaining space.