Lexicographic Constraint in CPSATLP

[Pierre Savéant]

Hi,

Is there an equivalence in Python for the MakeLexicalLess constraint proposed in the C++ reference guide of CP-SAT?

Arguments: const std::vector<IntVar*>& left, const std::vector<IntVar*>& right

Creates a constraint that enforces that left is lexicographically less than right.

Thanks

Pierre

[Laurent Perron]

This is not part of CP-SAT, even in c++.

--
You received this message because you are subscribed to the Google Groups "or-tools-discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to or-tools-discu...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/or-tools-discuss/cefa8055-f29d-42c1-b18c-40f52e9f4fdcn%40googlegroups.com.

[Pierre Savéant]

But it is available in MiniZinc and run well with cpsatlp ; It must be decomposed?

[Laurent Perron]

It is. Not a complex constraint. A chain of implications.

It has been done and explained, I think, in this mailing list.

Laurent Perron | Operations Research | lpe...@google.com | (33) 1 42 68 53 00

To view this discussion on the web visit https://groups.google.com/d/msgid/or-tools-discuss/0846a099-9c83-482b-94f7-b015978c2182n%40googlegroups.com.

[Luca Gangini]

Laurent, I read in your message "It has been done and explained, I think, in this mailing list.". Can you please point me to the explanation you are referring to? I did an implementation myself, but it is pretty slow and I think it could be done better.