Solving (k-1)-Stable Instances of k-terminal cut with Isolating Cuts.
Mark VelednitskyPublished in: COCOA (2019)
Keyphrases
- families of valid inequalities
- lower bound
- integer programming
- upper bound
- np complete problems
- stochastic local search
- np hard
- linear programming
- branch and bound algorithm
- timetabling problem
- lower and upper bounds
- valid inequalities
- randomly generated
- weighted max sat
- integer program
- solving problems
- branch and bound
- constraint programming
- scheduling problem
- evolutionary algorithm