Accelerating benders decomposition with heuristicmaster problem solutions

in this paper, a general scheme for generating extra cuts during the execution of a benders decomposition algorithm is presented. these cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. this article includes general guidelines and a case study with a fixed charge network design problem. computational tests with instances of this problem show the efficiency of the strategy. the most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any benders decomposition implementation.