All Versions
Latest Version
Avg Release Cycle
Latest Release

Changelog History
Page 2

  • v3.2 Changes

    ๐Ÿ›  1. Fixes few bugs ๐Ÿ“ฆ 2. Provides an interface from Scala to JaCoP. Examples using Scala are provided in ExamplesScala package.

  • v3.1.2 Changes

    ๐Ÿš€ The release of JaCoP version 3.1.2 fixes several bugs and makes JaCoP compatible with minizinc v.1.4.

    1. Compatibility changes for minizinc 1.4.
    2. Bug fix of reification in several primitive set constraints that made pruning working correctly.
    3. New method for pruning length of rectangles in Diff/Diff2 constraints. ๐Ÿ›  4. Several small bug fixes.
    4. Bug fix in search to make limit on a number of solutions work correctly (specially for sequence search).
  • v3.1.1 Changes

    1. Changes to bo compatible with minizinc v. 1.3.
    2. New pruning methods for multiplication and division constraints, icluding div and mod.
    3. Bug fix in Among constraint.
    4. Bug fix in SmallDenseDomain.
  • v3.1 Changes

    ๐Ÿš€ This release fixes few bugs as well as provides a new Binpacking constraint.

    The Binpacking constraint allows modeling of problems exhibiting bin packing problem structure. The addition of this constraint introduced ๐Ÿ”„ changes to minizinc/fz library in JaCoP since the definitions of bin_packing.mzn, bin_packin_capa.mzn and bin_packing_load.mzn have โšก๏ธ been added. The JaCoP guide has been updated to explain how to use Binpacking constraint.

  • v3.0 Changes

    ๐Ÿš€ We have just released JaCoP 3.0 final. Since the previous release ๐Ÿ›  (RC2) we have fixed one rarely triggering bug in ElementInteger ๐Ÿ‘ constraint, as well as added code supporting generation of data for CP-viz framework. Here is the list of most important changes since ๐Ÿ”– version 2.4.

    1) The introduction of Network Flow constraint, which allows efficient modeling of problems with network flow structure. The constraint allows to specify minimum cost flow problem in terms of finite domain variables. It uses network simplex algorithm as an propagator for network-like structure. It is a very expressive constraint where arc flow and arc unit costs can be specified by variables.

    ๐Ÿ“ฆ 2) The introduction of set package forced changes in the design of core interfaces. There are IntVar and SetVar classes which inherit from Var class. This change allowed to refactor and improve set package so it is designed in cleaner and more efficient manner.

    3) The introduction of special domain representation SmallDenseDomain, which uses bits within a long primitive type to encode small domains of range not larger than 64.

    4) The introduction of Soft-alldifferent as well as Soft-GCC global constraints. The soft-alldifferent constraint implements Variable and Decomposition based violation metrics. The soft-gcc constraint implements value based violation metric. Both are decomposed constraints based on network flow constraint.

    โšก๏ธ 5) Examples have been updated by moving multiple solving functionality from main function to test function, so user can easily see what is the best model just by looking at main function. BIBD example has been added. Examples with Set variables have been updated to reflect the changes.

    ๐Ÿ›  6) A number of bug fixes and changes in flatzinc interface to better comply with minizinc 1.1. We have also added into minizinc predicates networkflow that uses newly introduced JaCoP Network Flow constraint.

    7) A number of minor API changes to improve intuitiveness of use (e.g. order of arguments in constructors).

    โšก๏ธ 8) The JaCoP guide has been updated to reflect the changes and additions to the newest version.

  • v2.4.2 Changes

    ๐Ÿš€ The main reason for this release is change of Minizinc standard, the ๐Ÿ†• newest version handles Minizinc 1.1.

  • v2.4 Changes

    The version 2.4 has a number of new features in addition to some bug ๐Ÿ›  fixes. The most important additions in this version are:

    The flatzinc interface that makes it possible to run minizinc programs using JaCoP. The distribution contains number of different minizinc examples.

    Geometrical constraint, geost, based on pruning algorithms originally proposed by Nicolas Beldiceanu et al. This constraint makes it possible to define placement problems of non-convex objects in k-dimensional space.

    Knapsack constraint, which is based on the work published by Irit Katriel et al. We extend the original work in number of ways, for example by making it possible to use non-boolean quantity variables.

    Set constraints defining typical operation on sets using set interval variables.

  • v2.3 Changes

    ๐Ÿš€ As with previous releases, JaCoP focuses on ease of use, efficiency, and modeling power by providing more and more global constraints.

    In JaCoP 2.3 you'll notice:

    Number of new global constraints implemented, namely Among, GCC, ๐Ÿ‘ Regular, two new variants of ExtensionalSupport constraint (STR, MDD), Stretch, and Sequence constraints.

    Redesigned search functionality making it possible to express search ๐Ÿ”Œ as by designing search plugins and transforming available search.

    Redesigned part of the JaCoP core focusing on domains, making it easier to add new domains representations.

    ๐Ÿ‘ Significantly improved Java Doc API making code even better documented.

    Number of new examples explaining how to apply CP technology.

    ๐Ÿ”– Version JaCoP 2.2

    ๐Ÿ”– Version JaCoP 2.1

    ๐Ÿ”– Version JaCoP 1.7

    ๐Ÿ”– Version JaCoP 1.3