An improved binary programming formulation for the secure domination problem (Q828823)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved binary programming formulation for the secure domination problem |
scientific article; zbMATH DE number 7344044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved binary programming formulation for the secure domination problem |
scientific article; zbMATH DE number 7344044 |
Statements
An improved binary programming formulation for the secure domination problem (English)
0 references
5 May 2021
0 references
secure domination
0 references
binary programming
0 references
formulation
0 references
secure connected
0 references
0 references
0 references
0.7670685648918152
0 references
0.7663699388504028
0 references
0.7620709538459778
0 references
0.7612227201461792
0 references
0.7472306489944458
0 references
