Koalog Constraint Solver 3.0

Koalog Constraint Solver is a powerful constraint solver written in Java.
Koalog Constraint Solver project provides cutting-edge technology for solving satisfaction and optimization problems, including scheduling:
- scheduling: Koalog Constraint Solver provides a specific API for disjunctive scheduling;
- planning;
- time tabling;
- resource allocation;
- configuration: Koalog Configurator is powered by Koalog Constraint Solver;
- puzzles: sudoku.koalog.com is powered by Koalog Constraint Solver.
Enhancements:
Features:
- Added shaving methods to IntegerVariable.
- New constraints: LatinSquare, LatinSquare_SPARSE.
- Added back constraint Opp.
- New domain heuristic: RandomOrderDomainHeuristic.
- Various optimizations leading to a 25% performance improvement.
API changes:
- Renamed Range into InDomain.
- Renamed InRange into IsInDomain.
- Renamed Eq1 into Eq_1.
- Renamed Neq1 into Neq_1.
- Renamed Neq1_SPARSE into Neq_1SPARSE.