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.
Please, note that the sources from version 4.0 are only available at GitHub.
Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.
This is a C# library which contains classes for working in memory with MARC records ( http://www.loc.gov/marc/ ). This allows records to be read from MarcXML and Marc21 formats. Once in memory any field or subfield can be edited, added, or deleted. Then the record can be queried or saved again in either a MarcXML or Marc21 file format.
In addition, version 1.1 includes Z39.50 capability and auto-translation from the most common MARC8 characters into Unicode.
Enterprise-Grade Proxies • Built-in IP Rotation • 195 Countries • 20K+ Companies Trust Us
Get unrestricted access to public web data with our ethically-sourced proxy network. Automated session management and advanced unblocking handle the hard parts. Scale from 1 to 1M requests with zero blocks. Built for developers with ready-to-use APIs, serverless functions, and complete documentation. Used by 20,000+ companies including Fortune 500s. SOC2 and GDPR compliant.
Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.