Pages that link to "Item:Q1762029"
From MaRDI portal
The following pages link to A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029):
Displaying 5 items.
- The selective fixing algorithm for the closest string problem (Q336747) (← links)
- An improved integer linear programming formulation for the closest 0-1 string problem (Q1652195) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
