Algorithmic expedients for the \(S\)-labeling problem (Q2003435)
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 7077528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic expedients for the \(S\)-labeling problem |
scientific article; zbMATH DE number 7077528 |
Statements
Algorithmic expedients for the \(S\)-labeling problem (English)
0 references
8 July 2019
0 references
graph labeling
0 references
branch-and-cut
0 references
Lagrangian relaxation
0 references
constraint programming
0 references
0 references
0.8772095441818237
0 references
0.8680213689804077
0 references
0.8497873544692993
0 references
0.7657902240753174
0 references
0.7618086338043213
0 references
