[SCIP] branch-and-price-and-cut

[Horváth Markó]

Dear all,

I'm working on a branch-and-price-and-cut approach. Actually, it is a 
branch-and-price approach, where until now, branching decisions were 
handled by variable fixing (i.e., variables were fixed by the 
propagation callback of the corresponding constraint handler). However, 
I want to improve this branching, that is, in each child node I want to 
add multiple rows to the problem. Of course, I need to store these 
decisions to take them into consideration during variable pricing. (So, 
yet it is a branch-and-price-and-cut approach, but cuts are not added by 
separation procedure, but branching). I would like to ask, what is the 
best way to do that? (My best guess, is that in a branching rule I add 
the rows to the problem, and I also create a constraint sticked to child 
nodes. The corresponding constraint handler do nothing (may be 
propagation only), but could be used in variable pricing).

Thanks, and best regards,
Marko