Closed IgnaceBleukx closed 1 year ago
/
). Should this be changed to integer division? (related: a / 2 != b
is not supported by Gecode, a div 2 != b
is),p == (pow(a,2) >=< b)
gives a compiler error in FlatZinc: fixed in https://github.com/MiniZinc/libminizinc/issues/572[2,3,1]
while in the decomposition of circuit, the array must end with 0some_unsupported_operator >=< a) == b
becomes (some_unsupported_operator == c & (c >=< a) == b
)
Implementation should be done in linearize transformation. Or make use of the soon to be transformation from #105 we only support integer division (//), and the test_constraints test-suite is now ran on all supported solvers
When the Gurobi solver was added to the CPMpy library, tests for all flattened constraints were added in /tests/test_constraints.py.
Still to be done is running this suite on OR-tools and Minizinc solvers (and Pysat when int-to-bool is implemented)