Pages that link to "Item:Q2926047"
From MaRDI portal
The following pages link to A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047):
Displaying 5 items.
- The selective fixing algorithm for the closest string problem (Q336747) (← links)
- A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029) (← links)
- Improved LP-based algorithms for the closest string problem (Q1762033) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)