Jaromił Najman

Hi Erik, Great! I am happy that your code works now. Best regards, Jaromił

Hi, You can access a lot of intermediate information via callbacks (see here for the list of callback codes).Best regards, Jaromił

Hi Erik, As it is not possible to determine what data structures \(\texttt{nodes, items}\), and \(\texttt{orders}\) are, from you answers and the previous conversation I will assume that \(\texttt{...

Hi Erik, Are you iterating over the same sets? In the C++ code you iterate over \(\texttt{orders}\) while in the Python code you iterate over \(\texttt{clusters}\). I can't find \(\texttt{orders}\)...

Hi Erik, Your explanation sounds reasonable. You could try to reduce the size of this example while preserving the error, e.g., reduce the cluster sizes to only 2 and maybe reduce \(T\). You could ...

Hi Erik, You are right. Could you try start the \(\texttt{while True}\) loop with \(\texttt{t=3}\) or \(\texttt{t=4}\). This should work.Best regards, Jaromił

Hi Erik, \(\texttt{len(x)}\) will provide you the length of \(\texttt{x}\) combined over all for loops. You could simplify your code to have only one cluster \(\texttt{k}\). You can then divide by ...

Hi Jimmy, How do you express that \(J\) is a predecessor and  \(V\) is a successor? Is it modeled in a different constraint? In constraint (8), you use the set \(V\) only and since \(J\) has the sa...

Hi Erik, Could you print the length of x in each dimension to check which key seems to be invalid?Best regards, Jaromił

Hi Erik, Could you try converting \(\texttt{t+inst.distance(i,j)}\) to an \(\texttt{integer}\) as \(\texttt{int(t+inst.distance(i,j))}\)? Best regards, Jaromił