Pages that link to "Item:Q1761847"
From MaRDI portal
The following pages link to Efficient solutions for the far from most string problem (Q1761847):
Displaying 4 items.
- A nonmonotone GRASP (Q340011) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
