Solve an optimization problem using a tree algorithm as described in Scholtus (2009)
tree(B, kappa, delta = as.logical(rep(NA, ncol(B))), sol = NULL)
sol
binary matrix with suggested corrections per violated edit
frequency of suggested corrections
logical
vector with partial solution (starts with NA)
current best solution. (starts with null)