java - Efficient Algorithm to a Complicated backpack variation -


i trying find efficient algorithm problem

i have list of people each person knows how items need/want order , list of available items him.

the list of options contains options ordered kind of "score"

person:

  • num - number of wanted items
  • availableitems - list contains available items person

option

  • the items should ordered
  • some connection between item , person (the format not important)

input-

  • list of people
  • batchnum

output -

  • list of options

notes (may used efficiency) -

  • each person needs 1-8 items
  • each person have 3-n available items
  • the available items come closed list contains n available items (n 30 can change bit in future)
  • the list of options ordered score
  • each person prefers order unique items (effects score)
  • batchnum represents batches of each item (usually 2,3 or 4) meaning item can ordered in batch of batchnum

if batchnum=3 item x can ordered if there 3,6,9... on duplicates needed

.

.

.

currently algorithm dumb , calculates options taking time , cant find smart solution this

lets need 20 best scores can suggest better algorithm??

it written in java pseudo-code welcome if :)


Comments

Popular posts from this blog

facebook - android ACTION_SEND to share with specific application only -

python - Creating a new virtualenv gives a permissions error -

javascript - cocos2d-js draw circle not instantly -