in a combinatorial search space it's np-complete to find the right solutions.

So you need to use signals from previous use (were users implicitly happy) and also precompute interesting combinations before query time so they can be fast.