Hey everyone,
I am trying to implement a constraint programming problem from Matthias Grönkvist PhD thesis "The Tail Assignment Problem":
The goal is to assign vehicles (airplanes) to flight sequences. Therefore, every flight has a predecessor and a successor and an assigned aircraft. I implemented the domains and Constraints 9.1-9.3 without any problems with the standard functions from docplex.cp. I get into trouble with the tunneling function though:
------------------------------
Justus Kilian Wolff
------------------------------