v2.23.0
What's new
Parallel local search
LocalSolver now solves in parallel:
MinConflictsSolver: allmaxAttemptsrestarts run concurrently viaIntStream.parallel(). The satisfaction path returns whichever attempt finds a solution first (unordered for fastest short-circuit); the optimization path runs all attempts in parallel and returns the true global minimum across all of them.IndependentSubproblemLocalSolver: independent subproblems are solved concurrently viaparallelStream().
No API changes — parallelism is an implementation detail.