RO  EN
IMCS/Publications/BASM/Issues/BASM n.3(91), 2019/

Binary linear programming approach to graph convex covering problems

Authors: Radu Buzatu

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.

Moldova State University
60 A. Mateevici, MD-2009, Chisinau, Republic of Moldova
E-mail:



Fulltext

Adobe PDF document0.10 Mb