Merge branch 'release/4.1' into develop
Changing version in pom to 4.2-SNAPSHOT
Correcting Håkan Kjellerstrand name in floating point examples that are based on his minizinc code.
Adding functions for global coinstraint definitions to be compatible with minizinc v. 2.0.
Removing unnecessary definition; it appears in standard library.
New search method implementing "Solution-Guided Multi-Point
Constructive Search" based on the articel of J. Christopher Beck.
Implementation of SGMPCS method. Further improvements.
Improvements in SGMPCS and new search plug-in for finding a single
solution only.
Code cleaning.
Adding possibility to define your own improvement search, implementing
interface ImproveSolution.
Adding time-out in minimize method.
Making basis classes of the package sgmpcs expendable.
Changes in knapsack to make it possible define constraints with weight equal zero.
Changes in comments in networkflow.
Bug fix.
Extending min and max domain values to -1e-9 and 1e9 respectively to
address the problem with minizinc challenge.

Introducing a heuristic rule for posing SumWeightDom (domain
consistency linear constraint). Since the complexity of enforcing
consistency is O(d^n), where d is the maximal domain size and n is the
number of variables, we pose it only if d <= 4 or n <= 2.
Merge branch 'feature/scala' into develop
Merge branch 'feature/sgmpcs' into develop
Merge branch 'feature/minizinc-lib' into develop
New global constraint LexOrder that defines lexicographical order
between two vectors of the same length.

Performance improvements in AndBool and OrBool. It does not scan the
whole vector but only elements that are non-zero or non-one.

Checking overflow in Sum constraint.
Correcting spelling in CHANGELOG