[gecode-users] Gecode 3.7.0 released

[Guido Tack]

Dear all,

we are releasing a new version of Gecode:

        Gecode 3.7.0
 http://www.gecode.org

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, number of values for integer variables). All of these constraints (and some more) are now also available in FlatZinc. Additionally, some fixes and improvements.

This release is an important milestone as Gecode now provides native implementations for all important constraints available in MiniZinc/FlatZinc.

The documentation of constraints in "Modeling and Programming with Gecode" now refers to the Global Constraint Catalog (for those constraints that are listed in the catalog). To give you an idea, Gecode 3.7.0 implements 74 constraints from the catalog and quite some additional not listed in the catalog.

The ones listed in the catalog implemented by Gecode are: abs_value, all_equal, alldifferent, alldifferent_cst, among, among_seq, among_var, and, arith, atleast, atmost, bin_packing, bin_packing_capa, circuit, clause_and, clause_or, count, counts, cumulative, cumulatives, decreasing, diffn, disjunctive, domain, domain_constraint, elem, element, element_matrix, eq, eq_set, equivalent, exactly, geq, global_cardinality, gt, imply, in, in_interval, in_intervals, in_relation, in_set, increasing, int_value_precede, int_value_precede_chain, inverse, inverse_offset, leq, lex, lex_greater, lex_greatereq, lex_less, lex_lesseq, link_set_to_booleans, lt, maximum, minimum, nand, neq, nor, not_all_equal, not_in, nvalue, nvalues, or, roots, scalar_product, set_value_precede, sort, sort_permutation, strictly_decreasing, strictly_increasing, sum_ctr, sum_set, xor.

On our web site, you find source packages, binary packages for Windows and Mac OS, and the full documentation.

Cheers,
	Guido