Changelog History
Page 2
-
v4.1 Changes
New floating point variables and constraints on these variables.
Flatzinc interface for JaCoP's floating point constraints.
Scala interface for floating point constraints.
Fixing a bug in knapsack constraints when large numbers are used.
Implementing intersection method between SmallDenseDomain and BoundDomain.
-
v4.0.0 Changes
January 16, 2014🔖 Version 4.0.0
📦 1. Maven support and new directory structure. The package has changed name from JaCoP to org.jacop and files are placed in the new directory structure. 🚀 2. Experimental feature - stochastic variables and constraints - is moved to feature branch as it still requires additional testing. It is excluded from this release, but we encourage contribution in this branch (examples/tests in particular) to help us make it quicker a part of the next release. 🚀 3. Experimental feature SAT solver - JaSAT - is moved to experimental feature branch as its performance and integration with JaCoP still requires extra work. It is excluded from this release, but we encourage contribution in this branch to help us make it quicker a part of the next release.
- Adding constraint SumWeightDom that implements domain consistency for weighted sum of linear terms.
- New primitive constraint Linear and its use in flatzinc.
- New global constraint Subcircuit. ✅ 7. Adding additional propagation to Min and Max constraint. It propagates in situations when one variable on the list is lowest (greatest). It enforces that this variable from the list is equal min (max) variable. 🖨 8. Print of statistics for flatzinc (org.jacop.fz.Fz2jacop) after Ctrl-C. ⚡️ 9. Updated JaCoP guide to reflect new features. 🛠 10. Bug fixes.
-
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.
- Compatibility changes for minizinc 1.4.
- Bug fix of reification in several primitive set constraints that made pruning working correctly.
- New method for pruning length of rectangles in Diff/Diff2 constraints. 🛠 4. Several small bug fixes.
- Bug fix in search to make limit on a number of solutions work correctly (specially for sequence search).
-
v3.1.1 Changes
- Changes to bo compatible with minizinc v. 1.3.
- New pruning methods for multiplication and division constraints, icluding div and mod.
- Bug fix in Among constraint.
- 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.1 Changes
???
-
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.