Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Proportional distribution of indivisible items

by atcroft (Abbot)
on Aug 14, 2018 at 15:36 UTC ( #1220326=note: print w/replies, xml ) Need Help??


in reply to Proportional distribution of indivisible items

What you describe sounds like a variation on the Knapsack Problem (but I am guessing you already knew that). I have not kept up with the state-of-the-art in dealing with that problem (or any NP-complete problems, actually), but that would be where I would start for theory. In practice, if you are within a single-digit percentage of best results, I would leave it there unless your working set reaches a size where that difference becomes problematic.

Hope that helps.

  • Comment on Re: Proportional distribution of indivisible items

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1220326]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (3)
As of 2020-09-27 04:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    If at first I donít succeed, I Ö










    Results (142 votes). Check out past polls.

    Notices?