Ideally, one would use a heuristic solver (Pseudo or MPF) to get a fast, approximate solution then feed that into a slower, more accurate method (like MCH). Could we automate this using some kind of chaining function?
This would also need to preserve the intermediate states in case users would want to go back and use a previous solution.
Ideally, one would use a heuristic solver (Pseudo or MPF) to get a fast, approximate solution then feed that into a slower, more accurate method (like MCH). Could we automate this using some kind of chaining function?
This would also need to preserve the intermediate states in case users would want to go back and use a previous solution.