Algorithmic expedients for the \(S\)-labeling problem (Q2003435): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128116087, #quickstatements; #temporary_batch_1722518518227 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2019.04.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2019.04.014 / rank | |||
Normal rank | |||
Latest revision as of 17:47, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic expedients for the \(S\)-labeling problem |
scientific article |
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
