| 4 | Integer Programming Model for Maximum Clique in Graph显示文摘The maximum clique or maximum independent set of graph is a classical problem in graph theory. Com- bined with Boolean algebra and integer programming, two integer programming models for maximum clique problem, which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by sev- eral examples. | YUANXi-bo YANGYou ZENGXin-hai | 2005 | Journal of China University of Mining and Technology2005，15，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员