Carl Baier

Jaromił Najman Thanks. Is there any quick way to collect all those variables?

Jaromił Najman  Are there any start guides that can help with the implementation of Branch-n-Price?  And over the weekend I thought of two more questions. 1) Is it possible to delete all the unused...

Jaromił Najman  Nevermind, I swapped the values of the classic model (without CG) and the column generation. As a result, the column generation performs just as well in some instances as the simple...

Jaromił Najman  Thank you very much. It's finally working. I have now adapted these two functions, and now it works. It also spits out the same optimal values \(motivation\) after finalSolve() as i...

Jaromił Najman  Thank you very much. It is quite surprising, then, that in Iteration 1, this solution vector for the SP(1) is being derived: Optimal Values Iteration 1 for SP 1: {(1, 1, 1, 2): 0.0,...

Jaromił Najman I was just able to test it and I observed the following: 1) If I increase max_itr, then the reduced cost of the subproblem also changes, albeit marginally. I think this is because th...

Jaromił Najman Would something like this work? Sadly my PC with PyCharm broke down today and i cant test it right now. def addColumn(self, newSchedule): self.newvar["motivation_i"] = {} for ...

Jaromił Najman Thanks, I could have figured it out myself. I fixed it. Yes, I think the model is currently non-convex, because of the quadratic formulation of \(\lambda \cdot motivation\), so the p...

Jaromił Najman Thanks for the clarification. I have now decided to add the \(\lambda\)'s via expr.add and it "works" too, although only 90%. I have added this function: def addLambda(self, index, ...

Jaromił Najman Is that what you mean? def addColumn(self, newSchedule): self.nurseIndex = index self.rosterIndex = itr + 1 self.newvar = {} colName = f"Schedule[{self.nurseIndex},{sel...