Using the bilevel integer programming model, we develop a branch and bound algorithm that effectively finds all of the minimal alterations. Through a computational study with eleven Boolean networks ...