A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029)
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: A heuristic algorithm based on Lagrangian relaxation for the closest string problem |
scientific article; zbMATH DE number 6107503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic algorithm based on Lagrangian relaxation for the closest string problem |
scientific article; zbMATH DE number 6107503 |
Statements
A heuristic algorithm based on Lagrangian relaxation for the closest string problem (English)
0 references
15 November 2012
0 references
closest string problem
0 references
mixed-integer programming
0 references
Lagrangian relaxation
0 references
tabu search
0 references
0 references
