LP-based heuristics for the distinguishing string and substring selection problems (Q2675721)
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: LP-based heuristics for the distinguishing string and substring selection problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LP-based heuristics for the distinguishing string and substring selection problems |
scientific article |
Statements
LP-based heuristics for the distinguishing string and substring selection problems (English)
0 references
26 September 2022
0 references
matheuristic
0 references
variable neighbourhood search
0 references
distinguishing string selection problem
0 references
distinguishing substring selection problem
0 references
0.94452715
0 references
0 references
0.88584936
0 references
0.8776345
0 references
0.86894405
0 references
0.86478746
0 references
0.86044025
0 references
0.8594577
0 references
0.85924584
0 references
