A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2011.06.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2011.06.005 / rank | |||
Normal rank | |||
Latest revision as of 09:09, 11 December 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
0 references
