Pages that link to "Item:Q2483510"
From MaRDI portal
The following pages link to A parallel multistart algorithm for the closest string problem (Q2483510):
Displaying 11 items.
- An optimization modelling for string selection in molecular biology using Pareto optimality (Q639159) (← links)
- Improved optimization modelling for the closest string and related problems (Q651767) (← links)
- Exact algorithm and heuristic for the closest string problem (Q716344) (← links)
- An improved integer linear programming formulation for the closest 0-1 string problem (Q1652195) (← links)
- Efficient solutions for the far from most string problem (Q1761847) (← 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)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- On some multiobjective optimization problems arising in biology (Q2995503) (← links)
- Parallel metaheuristics: recent advances and new trends (Q4921253) (← links)
