Affiliation:
1. Military Academy, Department of Natural Sciences and Mathematics, Belgrade
Abstract
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.
Publisher
National Library of Serbia
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献