(no title)
stefanlindbohm | 1 year ago
Having spent the past year building a journey planner algorithm, which heavily builds on pareto optimality/sets, from scratch, I was waiting for the full set of pareto optimal solutions. I.e. all kart combinstions that are best in at least one way.
Should be doable by iterating through all possible stats and merging[1] into a set for each one. We might get a lot of solutions, but it should be somewhat managable.
Has anyone tried this?
1: Merging is to take the new entry and 1) removing any existing entry that is dominated by it, and 2) adding the entry if it is not dominated by any existing entry.
ndr|1 year ago