A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:16, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic algorithm based on Lagrangian relaxation for the closest string problem |
scientific article |
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
