This paper introduces a new optimisation criterion to separate constraints so as to reduce the number of iterations for a network design dedicated Benders-like constraint generation procedure. With this criterion we try to minimize the number of iterations by maximizing the value difference of the objective function between the iterations. The criterion is used to generate efficient bipartition cuts and accelerate a network design method by Gabrel, Knippel and Minoux.