Pages that link to "Item:Q1762029"

The following pages link to A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029):

Displaying 3 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)
• On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)