Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6121549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA |
scientific article; zbMATH DE number 6121549 |
Statements
Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (English)
0 references
3 January 2013
0 references
DC programming and DCA
0 references
exact penalty
0 references
minimum dominating set
0 references
0 references
0 references
0 references
0 references
0 references
0.7483672499656677
0 references
0.7420517802238464
0 references
0.7390367388725281
0 references
0.7313910722732544
0 references
0.7283622622489929
0 references
