Gecode is a portable, accessible, and efficient environment for developing constraint-based systems and applications. Gecode is radically open for programming, meaning that it can be easily interfaced to other systems. It supports the programming of new propagators (as implementation of constraints), branching strategies, and search engines. New variable domains can be programmed at the same level of efficiency as finite domain and integer set variables that come predefined with Gecode.
|Tags||Software Development Libraries|
|Operating Systems||Mac OS X Windows POSIX|
Release Notes: This release fixes several small bugs.
Release Notes: This release fixes several bugs, upgrades to MiniZinc version 1.4, and features some minor improvements.
Release Notes: This release adds and improves quite a number of constraints: total lexicographic order for set variables, membership constraints for integer variables, counting constraints for integer variables using integer sets, range, roots, set element constraints for integer variables, and number of values for integer variables. All of these constraints (and some more) are now also available in FlatZinc. Additionally, there were some fixes and improvements.
Release Notes: This release adds new constraints (value precedence constraints for integer and set variables, no-overlap constraints for rectangles, constraints for Hamiltonian paths), improves and cleans up a number of existing constraints (scheduling, channeling, relation, bin-packing, lexicographic relations), and adds new functionality (support for externalization of choices for distributed search, support for incremental propagation). On top, there are many small fixes, in particular for FlatZinc.
Release Notes: This release fixes serious bugs in parallel search and FlatZinc, fixes some DLL issues on Windows, adds support for FreeBSD, and adds STL-style iterators for arrays.