Accelerating Benders Decomposition with Heuristic Master 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… (More)

2 Figures and Tables


  • Presentations referencing similar topics