Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
So i got that step working, and the general concept is making sense, but having trouble making the connection between the "s-t" min cut and how to translate to which nodes to destroy to sever the s-t connection
@Haukinger, can you give any more explanation on that? I tried looking for some documentation, but what you described sounds exactly what I am looking for.
Yes, I have been trying to get the CBC solver, it runs and goes through pre process and gets into primal / dual stuff but when it hits wall clock it says no optimal solution, but doesn’t even return a feasible one
I will have to give CP-SAT a try then. Right now I am running a purely binary/bool problem with about 1 million decision variables. The challenge is that I am actually not to concerned about running until optimality, I just wanted to be able to run for a given period of time (~30 min to 2 hours) to provide a decent feasible solution. The two challenges i hit: 1) CBC just goes through the Primal/Dual during that time and returns no feasible solutions, and then with CP-SAT i need to change the formulation since I leverage several thousand RowConstraints.
Rob, thank you for the help on the actual “formulation.” I don’t have a true OR background, but the concepts made a lot of sense to me. That is actually how I implemented the MILP but couldn’t describe to well with words, the use of the decision variables and then the what I call switching variables (T)
