Solving (k-1)-stable instances of k-terminal cut with isolating cuts.

Mark Velednitsky

Published in: J. Comb. Optim. (2022)

Keyphrases

families of valid inequalities
lower bound
integer programming
np hard
upper bound
timetabling problem
branch and bound
optimal solution
np complete
cutting plane
sat instances
np complete problems
column generation
lower and upper bounds
integer program