Heuristic approaches to the distinguishing substring selection problem (Q1791942)
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: Heuristic approaches to the distinguishing substring selection problem |
scientific article; zbMATH DE number 6951756
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic approaches to the distinguishing substring selection problem |
scientific article; zbMATH DE number 6951756 |
Statements
Heuristic approaches to the distinguishing substring selection problem (English)
0 references
11 October 2018
0 references
integer programming
0 references
variable neighborhood search
0 references
rounding heuristic
0 references
0.94452715
0 references
0 references
0.88943076
0 references
0.8741047
0 references
0 references
0.8514543
0 references
