Ole Kröger

Sorry that is a small error on my side. Good catch. A fix is on its way. Unfortunately my solver has quite some troubles solving it at the moment.Not sure...

The optimal solution is `limit = 3`, right? I'm a bit confused why it takes so long when optimizing. When setting limit to `

I found out why this is very slow in general: - The reified constraint doesn't anti prune see #222 - It's not immediately obvious that the sum over the b...

For clarification: The `b` basically encodes whether it's active in the given time. We want that every task is completed until our maximum end time. This means that when we...

Unfortunately because of the other problems I have identified this will still take a minute to solve. Even with #222 because of the branching strategy. I'll do more research on...

The first version can work by changing it to: ``` @constraint(model, m7 := { m3 => {m6 == 1}}) ``` which isn't implemented yet but would be easy. It's probably...

The first is now implemented. Will check what I can do to support a different `lhs` of a reified or indicator constraint. Also support for `>` or `>=` is still...

How about `max_solutions` ? `n_solutions` sounds like if `n_solutions = 2` and there is only one then the problem is infeasible or is that actually what you want?

I have some problems and maybe you ( @hakank ) can help me out :wink: If the uses the default it will compute one solution only, right? So `max_solutions` is...

Currently I have `all_solutions` and `all_optimal_solutions`. In general the `-a` flag is probably most helpful when using with a callback such that one can actually get the solutions during the...