This article is cited in 1 paper

Research articles

Binary linear programming approach to graph convex covering problems

Radu Buzatu

Moldova State University, 60 A. Mateevici, MD-2009, Chişinău, Republic of Moldova

Abstract: 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.

Keywords and phrases: binary linear programming, convex cover, convex partition, graph.

MSC: 05A18, 68R10, 90C05, 90C27, 90C35

Received: 14.06.2019

Language: English