JConstraints

JConstraints is a Java Framework that enables implementations of advanced solutions for combinatorial problems as constraints satisfaction problems.

The architecture was built thinking in the constraints satisfaction paradigm. The Framework is easy to use. Therefore, with few interfaces implementations you can already run advanced combinatory solutions.

Just to name a few algorithms, the Framework can solve any constraints problems using:

- Regular Backtracking;
- A variety of Backjumping algorithms;
- A variety of arc-consistency algorithms;
- Local search algorithm;
- Tabu search algorithm;
- Maximize solutions: comming soon;
- Minimize solutions: comming soon;

The Framework also enables heuristic injections so that the developers can achieve greater performance of algorithms using their own heuristics.

Version 1.0: Released!
Version 1.1: Coming soon

See the tutorial in the Wiki page to learn how to use this Framework.