The selective fixing algorithm for the closest string problem (Q336747): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 94B05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6650557 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
closest string problem | |||
| Property / zbMATH Keywords: closest string problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
heuristics | |||
| Property / zbMATH Keywords: heuristics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
continuous relaxation | |||
| Property / zbMATH Keywords: continuous relaxation / rank | |||
Normal rank | |||
Revision as of 05:18, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The selective fixing algorithm for the closest string problem |
scientific article |
Statements
The selective fixing algorithm for the closest string problem (English)
0 references
10 November 2016
0 references
closest string problem
0 references
heuristics
0 references
continuous relaxation
0 references
