A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem
Zoran A. Maksimovic · Publications de l Institut Mathematique · 2016
We give a new mixed integer linear programming (MILP) formulation for Maximum Degree Bounded Connected Subgraph Problem (MDBCSP). The proposed MILP formulation is the first in literature with polynomial number of constraints. Therefore, it will be possible to solve optimally much more instances before in a reasonable time.