no code implementations • 18 Jul 2023 • Mikhail Shirokikh, Ilya Shenbin, Anton Alekseev, Sergey Nikolenko
Boolean satisfiability (SAT) is a fundamental NP-complete problem with many applications, including automated planning and scheduling.
Scheduling