|
|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2019, Number 3, Pages 54–59
(Mi basm517)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 14.06.2019
Citation:
Radu Buzatu, “Binary linear programming approach to graph convex covering problems”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2019, no. 3, 54–59
Linking options:
https://www.mathnet.ru/eng/basm517 https://www.mathnet.ru/eng/basm/y2019/i3/p54
|
| Statistics & downloads: |
| Abstract page: | 221 | | Full-text PDF : | 110 | | References: | 46 |
|