Minimum common string partition: on solving large‐scale problem instances (Q6088232)
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: Minimum common string partition: on solving large‐scale problem instances |
scientific article; zbMATH DE number 7766416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum common string partition: on solving large‐scale problem instances |
scientific article; zbMATH DE number 7766416 |
Statements
Minimum common string partition: on solving large‐scale problem instances (English)
0 references
16 November 2023
0 references
minimum common string partition
0 references
large-scale problem instances
0 references
reduced variable neighborhood search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.96592706
0 references
0 references
0.9435288
0 references
0.9435285
0 references
0.9381007
0 references
0 references
0.92614937
0 references
0 references
