Аннотация:
A binary linear programming (BLP) formulation of graph convex covering problems is proposed for the first time. Since the general convex covering problem of a graph is NP-complete, BLP approach will facilitate the use of convex covers and partitions of graphs in different real applications.
Ключевые слова и фразы:
binary linear programming, convex cover, convex partition, graph.
Полный текст:
PDF файл (98 kB)