Pages that link to "Item:Q716344"
From MaRDI portal
The following pages link to Exact algorithm and heuristic for the closest string problem (Q716344):
Displaying 12 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 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)
- LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
- Optimal solutions for the closest-string problem via integer programming (Q2890443) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
- Enumerating Neighbour and Closest Strings (Q4899258) (← links)
- Randomized and Parameterized Algorithms for the Closest String Problem (Q5165596) (← links)
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)