| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 408 5 |
| Ultima descărcare din IBN: 2023-12-05 10:18 |
| Căutarea după subiecte similare conform CZU |
| 519.854.2 (1) |
| Operational research (OR): mathematical theories and methods (169) |
 SM ISO690:2012BUZATU, Radu. Binary linear programming approach to graph convex covering problems. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2019, nr. 3(91), pp. 54-59. ISSN 1024-7696. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica |
|||||||
| Numărul 3(91) / 2019 / ISSN 1024-7696 /ISSNe 2587-4322 | |||||||
|
|||||||
| CZU: 519.854.2 | |||||||
| MSC 2010: 05A18, 68R10, 90C05, 90C27, 90C35. | |||||||
| Pag. 54-59 | |||||||
|
|||||||
 Descarcă PDF |
|||||||
| Rezumat | |||||||
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. |
|||||||
| Cuvinte-cheie binary linear programming, convex cover, convex partition, graph |
|||||||
|
|
|
|
