Ole Kröger
Ole Kröger
I'll focus on the element constraints for not but this should be fairly easy to add I think. For now you might want to solve it using the TableConstraint
BTW if you're interested in special constraints please feel free to open a PR yourself if interested. I can guide you through the necessary steps.
It's currently not planned to do this even though JuMP supports non linear constraints. The problem for the constraint solver is that I don't know how to prune such constraints.
Yes whereas there it might be easier to do something I think. I was think I can support them if I have something like: monotonically increasing in all variables but...
I currently lack of an example when this will be useful as I'm not really experienced in modelling. Do you mind giving an example model? 😁
Activity branching https://arxiv.org/pdf/1105.6314.pdf
Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems: - http://users.sch.gr/abalafoutis/pdf/SETN2010.pdf Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems - http://ceur-ws.org/Vol-451/paper02balafoutis.pdf
In general the reference section is basically non existent yet.
Thanks for opening the issue. The short version: This is currently not possible. There is currently no way to index an array by the value of a variable in JuMP....
I would write it as a binary problem as well. At least currently I can't think of a workaround. Nevertheless thanks for having another try at my solver :smile: