lperron@google.com
|
521bb0a986
|
more tuning of the queue
|
2012-09-07 16:41:59 +00:00 |
|
lperron@google.com
|
dc1c72ab07
|
split Enqueue into EnqueueVar and EnqueueDelayedDemon
|
2012-09-07 15:27:53 +00:00 |
|
lperron@google.com
|
0e25846441
|
execute normal demons directly instead of queueing them in the variable process; remove the need for ProcessDemonsOnQueue
|
2012-09-07 14:48:11 +00:00 |
|
lperron@google.com
|
9d1882830a
|
more code cleaning
|
2012-09-07 14:18:09 +00:00 |
|
lperron@google.com
|
2c143761ac
|
remove virtualization on queue containers, more code cleaning
|
2012-09-07 13:45:02 +00:00 |
|
lperron@google.com
|
cda74dec74
|
clean MaxIntExpr, MinIntExpr methods
|
2012-09-07 13:28:11 +00:00 |
|
lperron@google.com
|
8bf75a2bc9
|
tune queue
|
2012-09-07 12:28:40 +00:00 |
|
lperron@google.com
|
9dc72fc79e
|
more work on queue
|
2012-09-07 12:20:47 +00:00 |
|
lperron@google.com
|
df300bd74e
|
rewrite queue
|
2012-09-07 12:14:10 +00:00 |
|
lperron@google.com
|
ff79a72cc2
|
added Range on IntAbs()
|
2012-09-07 11:52:55 +00:00 |
|
lperron@google.com
|
0799c2e565
|
simplify IntAbs, add SetRange method
|
2012-09-07 09:08:28 +00:00 |
|
lperron@google.com
|
cedf459b4d
|
split SubIntExpr into safe and unsafe version
|
2012-09-07 08:47:35 +00:00 |
|
lperron@google.com
|
48727bfc6d
|
small improvement in modulo
|
2012-09-06 22:05:27 +00:00 |
|
lperron@google.com
|
0fb7120aa3
|
small improvement in modulo
|
2012-09-06 20:56:36 +00:00 |
|
lperron@google.com
|
d43117ff4a
|
small improvement in modulo
|
2012-09-06 20:50:05 +00:00 |
|
lperron@google.com
|
28d6ae1b1c
|
better bound positive modulo
|
2012-09-06 19:22:06 +00:00 |
|
lperron@google.com
|
433768e7a7
|
better bound positive modulo
|
2012-09-06 19:20:40 +00:00 |
|
lperron@google.com
|
82d36fde0d
|
improve pair_divide_the_sum by improving int_mod
|
2012-09-06 17:37:47 +00:00 |
|
lperron@google.com
|
13c7b8ee58
|
improve pair_divide_the_sum by improving int_mod
|
2012-09-06 17:35:13 +00:00 |
|
lperron@google.com
|
4bdafb76bd
|
improve abs
|
2012-09-06 14:33:35 +00:00 |
|
lperron@google.com
|
c52ccfe9af
|
Sort variables by size in buckets for the default search
|
2012-09-06 13:24:45 +00:00 |
|
lperron@google.com
|
5a3d03166e
|
more robust optim of IsEqualCt and IsDifferentCt
|
2012-09-06 11:52:01 +00:00 |
|
lperron@google.com
|
567874af31
|
improve IsEqualCt and IsDifferentCt
|
2012-09-06 10:03:47 +00:00 |
|
lperron@google.com
|
fc03ece403
|
improve IsEqualCt and IsDifferentCt
|
2012-09-06 09:50:39 +00:00 |
|
lperron@google.com
|
68e58eca7c
|
fix
|
2012-09-06 09:25:11 +00:00 |
|
lperron@google.com
|
8bc2ee77d6
|
better decision builder for one-constraint variables
|
2012-09-05 21:05:04 +00:00 |
|
lperron@google.com
|
0bd2d5e6e9
|
simplify binary IsXXX constraints
|
2012-09-05 16:42:49 +00:00 |
|
lperron@google.com
|
be9bf78ac5
|
simplify isequalct
|
2012-09-05 16:37:24 +00:00 |
|
lperron@google.com
|
1323b5166c
|
optimize element if index is bound, fix display bug
|
2012-09-05 15:52:26 +00:00 |
|
lperron@google.com
|
a744c07a3c
|
introspect and linearize MakeSum
|
2012-09-05 15:52:00 +00:00 |
|
lperron@google.com
|
c4549dd667
|
recognize variables in only one constraint and assign them later
|
2012-09-05 15:50:25 +00:00 |
|
lperron@google.com
|
345ace1f86
|
clean expr_array code
|
2012-09-04 21:40:12 +00:00 |
|
lperron@google.com
|
52538f15e6
|
fix
|
2012-09-04 20:55:29 +00:00 |
|
lperron@google.com
|
7701972aa1
|
flatten nested int_min and int_max
|
2012-09-04 16:51:51 +00:00 |
|
lperron@google.com
|
bb29603649
|
fix
|
2012-09-04 07:26:22 +00:00 |
|
lperron@google.com
|
5e1ff9e1d0
|
minor model simplifications
|
2012-09-03 21:40:45 +00:00 |
|
lperron@google.com
|
491b9d8676
|
minor simplifications for number_generation
|
2012-09-03 20:20:34 +00:00 |
|
lperron@google.com
|
062e8cba72
|
one more presolve rule, helps on debruijn_mike_winter2
|
2012-09-03 19:39:43 +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
|
63b9fcc4e9
|
global cardinality variations
|
2012-09-03 17:45:47 +00:00 |
|
lperron@google.com
|
352d6dc413
|
fix
|
2012-09-03 16:31:22 +00:00 |
|
lperron@google.com
|
bd950db860
|
more presolve
|
2012-09-03 14:52:41 +00:00 |
|
lperron@google.com
|
0f764403c3
|
better detection of hidden sum, kills map_coloring_with_costs
|
2012-09-03 14:33:35 +00:00 |
|
lperron@google.com
|
59f47be402
|
better detection of hidden sum, kills map_coloring_with_costs
|
2012-09-03 14:31:45 +00:00 |
|
lperron@google.com
|
f09ec03bf4
|
more presolve, kills assignment6
|
2012-09-03 14:17:42 +00:00 |
|
lperron@google.com
|
309c501194
|
speed up modulo
|
2012-09-03 13:26:49 +00:00 |
|
lperron@google.com
|
ab7a8c561c
|
remove duplicate variable in fz search
|
2012-09-03 12:18:27 +00:00 |
|
laurent.perron@gmail.com
|
191c847018
|
reorder code
|
2012-08-31 20:55:03 +00:00 |
|
laurent.perron@gmail.com
|
5d563ad6cb
|
safe start/duration/end expr on interval with fallback values
|
2012-08-31 20:42:22 +00:00 |
|
laurent.perron@gmail.com
|
2afa80605a
|
prepare for cover interval
|
2012-08-31 16:17:59 +00:00 |
|