Project level: PhD, Masters, Honours, Summer

This project considers the attached paper: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.

The paper applies Benders Decomposition by repeatedly solving the master problem and adding Benders cuts.  This approach could be potentially be improved by adding Lazy Cuts in the Branch and Bound tree.

The project would seek to replicate and/or improve on the results obtained in the paper.

Project members

Dr Michael Forbes

Senior Lecturer