Hyperparameter Optimization of Constraint Programming Solvers

This paper addresses the critical challenge of hyperparameter optimization for Constraint Programming (CP) solvers. It proposes advanced techniques to automatically tune these parameters, significantly enhancing the efficiency and effectiveness of CP solvers. This work has broad real-world applicability in solving complex combinatorial problems in fields like scheduling, logistics, and resource allocation.