lperron@google.com
|
5700126591
|
added setup dependent transition times on the disjunctive class; renamed files with - in their names to _; plenty of changes in the base library and modifications in the rest of the code accomodate them; dropped support for vs 2010 by using the brand new c++11 iterators (for (int i : vector_of_ints) {}). This is so neat; removed SetCommandLines on the routing model. I added a temporary API with parameters. This API is not final and will change to its final version soon
|
2013-10-10 15:23:20 +00:00 |
|
lperron@google.com
|
452eea95cc
|
30% speedup on oc-roster, propagate constant in x * constant across abs and int_lin_le; Simplify int_lin_le by gcd; replace x + (-y) by x - y; do not create the IntAbsConstraint() always when the argument is a small var
|
2013-09-19 06:59:49 +00:00 |
|
lperron@google.com
|
ae2b3d6870
|
simplify scal_prod if all abs(coeeficients) are equals; gains 15% on oc-roster.mzn
|
2013-09-18 17:07:01 +00:00 |
|
lperron@google.com
|
85b4c80b50
|
more caching in MakeScalProd, adds small filters to MinConstraint::LeafChanged and MaxConstraint::LeafChanged to avoid calling PushUp
|
2013-08-01 23:49:28 +00:00 |
|
lperron@google.com
|
fd013b575b
|
more caching in MakeScalProd, adds small filters to MinConstraint::LeafChanged and MaxConstraint::LeafChanged to avoid calling PushUp
|
2013-08-01 23:38:44 +00:00 |
|
lperron@google.com
|
7d4868e07f
|
a bit a cleanup
|
2013-08-01 22:17:49 +00:00 |
|
lperron@google.com
|
bc302f16c4
|
sync with internal code; mostly reindent; implemented very naive circuit constraint. It is actually slower than the expanded version in minizinc; hook up the circuit constraint everywhere (io, flatzinc...)
|
2013-07-24 00:28:11 +00:00 |
|
lperron@google.com
|
524b955eb1
|
remove debug code
|
2013-07-22 18:33:01 +00:00 |
|
lperron@google.com
|
66510d7a85
|
remove log
|
2013-07-22 18:31:22 +00:00 |
|
lperron@google.com
|
139199fcb3
|
abort creating cast variables
|
2013-07-19 03:47:59 +00:00 |
|
lperron@google.com
|
253cad197a
|
fix
|
2013-06-18 13:21:15 +00:00 |
|
lperron@google.com
|
0f76f66b81
|
improve propagation trace; fix bug in x * cst, cst < 0; fix missing propagation on safe interval expressions; speedup local search for slack cost in the routing library; revamp expression linearization in MakeSum and MakeScalProd
|
2013-06-18 09:43:51 +00:00 |
|
lperron@google.com
|
874aa36ead
|
huge sync with internal version
|
2013-06-11 14:49:19 +00:00 |
|
lperron@google.com
|
dc1c72ab07
|
split Enqueue into EnqueueVar and EnqueueDelayedDemon
|
2012-09-07 15:27:53 +00:00 |
|
lperron@google.com
|
a744c07a3c
|
introspect and linearize MakeSum
|
2012-09-05 15:52:00 +00:00 |
|
lperron@google.com
|
345ace1f86
|
clean expr_array code
|
2012-09-04 21:40:12 +00:00 |
|
lperron@google.com
|
9d2a791457
|
expose helpers when reinforcing constraints, add README in flatzinc examples to recognize Hakan's contribution; clean up some factory code; recognize special case of distribute as all different
|
2012-09-03 19:14:18 +00:00 |
|
lperron@google.com
|
2e8530d7eb
|
plenty of bugs found by the minizinc challenge presubmission
|
2012-08-15 22:22:32 +00:00 |
|
lperron@google.com
|
07db8f9959
|
adds a lot of missing DebugSring() all around
|
2012-08-14 18:00:08 +00:00 |
|
lperron@google.com
|
f2759c1cb9
|
simplify sum (ai * bi) >= 1 for bi booleans, ai >= 0; Move transformation of le to ge into presolve mode
|
2012-07-06 19:58:21 +00:00 |
|
lperron@google.com
|
d847d36156
|
small improvement
|
2012-07-06 15:59:16 +00:00 |
|
lperron@google.com
|
0d421c110d
|
fix unsats
|
2012-07-06 12:03:37 +00:00 |
|
lperron@google.com
|
fcccdbdf22
|
model simplifications
|
2012-07-05 13:27:16 +00:00 |
|
lperron@google.com
|
999be2637b
|
hook the right constraints
|
2012-07-05 12:54:25 +00:00 |
|
lperron@google.com
|
7262fc4c8c
|
rewire boolean sum eq
|
2012-07-05 10:51:07 +00:00 |
|
lperron@google.com
|
6b394c1bed
|
missing propag
|
2012-06-30 21:49:51 +00:00 |
|
lperron@google.com
|
d3bf29bde0
|
fix
|
2012-06-30 20:24:22 +00:00 |
|
lperron@google.com
|
ba71bdc845
|
fix
|
2012-06-30 19:35:22 +00:00 |
|
lperron@google.com
|
8aa32b5159
|
faster implementation of array_bool_or and array_bool_and
|
2012-06-30 15:28:09 +00:00 |
|
lperron@google.com
|
6c55707545
|
improve array_bool_and
|
2012-06-30 15:12:14 +00:00 |
|
lperron@google.com
|
d46d13803a
|
improve MakeScalProd
|
2012-06-29 20:03:47 +00:00 |
|
lperron@google.com
|
640ba535ff
|
experimental code to linearize the scal prod
|
2012-06-29 17:09:19 +00:00 |
|
lperron@google.com
|
45eab827fb
|
small improvements and new problems
|
2012-06-29 05:44:36 +00:00 |
|
lperron@google.com
|
0c45babd7d
|
fix
|
2012-06-27 06:19:00 +00:00 |
|
lperron@google.com
|
8294e8ccff
|
simplify code
|
2012-06-26 21:40:37 +00:00 |
|
lperron@google.com
|
b22ea04297
|
simplify code
|
2012-06-26 21:39:12 +00:00 |
|
lperron@google.com
|
8a26929d55
|
misc improvements
|
2012-06-26 15:40:19 +00:00 |
|
lperron@google.com
|
675b2861b9
|
better MakeScalProdLessOrEqual
|
2012-06-23 18:58:32 +00:00 |
|
lperron@google.com
|
af0b70f23b
|
fix memory leaks, speed up routing
|
2012-06-19 10:34:21 +00:00 |
|
lperron@google.com
|
8cd147397d
|
MakeScalProdEquality signature with IntVar target
|
2012-06-18 15:05:28 +00:00 |
|
lperron@google.com
|
175fcd66bb
|
var watchers, prepare caching of scal prods
|
2012-06-15 15:55:16 +00:00 |
|
lperron@google.com
|
5679c75593
|
small improvements on MakeIsEqualCstVar
|
2012-06-15 09:03:39 +00:00 |
|
lperron@google.com
|
cc314cc490
|
cache min_array and max_array
|
2012-06-14 19:44:27 +00:00 |
|
lperron@google.com
|
9b359f5c2c
|
cache binary and n-ary sum
|
2012-06-14 19:32:41 +00:00 |
|
lperron@google.com
|
f5546aa29e
|
2nd part overflow handling
|
2012-06-14 16:43:04 +00:00 |
|
lperron@google.com
|
6edcd89e10
|
improve make scal prod
|
2012-06-09 08:52:59 +00:00 |
|
lperron@google.com
|
d834790d3c
|
improve make scal prod
|
2012-06-09 08:48:49 +00:00 |
|
lperron@google.com
|
97c766818b
|
fix
|
2012-06-05 08:50:33 +00:00 |
|
lperron@google.com
|
f65f84cea9
|
fix
|
2012-06-04 14:11:32 +00:00 |
|
lperron@google.com
|
20384fa24b
|
improve MakeScalProdEquality
|
2012-06-02 18:52:41 +00:00 |
|