JaCoP
Description
JaCoP is a Java Constraint Programming solver. It provides a significant number of (global) constraints to facilitate efficient modeling of combinatorial problems, as well as modular design of search. Documentation is available at project Web site.
Categories
License
Features
- global constraints
- modular search
Update Notifications
User Ratings
User Reviews
-
JaCoP is very helpful. Its documentation and also the provided samples are a very good introduction to the library. And I liked the way constraints can be composed. http://slowfrog.blogspot.com/2012/02/hexiom-constraints-and-libraries.html
-
I have been using JaCoP in the context of my PhD. JaCoP is very intuitive to use, probably more than Linear Programming solvers. The files are well documented and numerous examples help to understand how to use the existing constraints. I also received feedback from the authors (fast and accurate reply) which helped me to develop new constraints. With that, I not only obtained valuable results for my PhD. I also demonstrated that CP can be used in the context of optical networks, which generated lot of interest in several workshop and conferences. For these reasons and several others (space is missing), I recommend to try JaCoP (as to try it is to love it).
-
JaCoP is really a great CSP solver. I use it for my PhD research in the area of semi-automatic design of messaging-based enterprise application integration solutions. JaCoP is very quick and flexible tool and I strongly recommend it.
-
JaCoP is a very handy Constraint Programming Library, it is fairly well documented and the authors are very responsive to requests from users.
-
Works, very small, no complaints.
-
terrific program