Pages that link to "Item:Q1761970"
From MaRDI portal
The following pages link to A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970):
Displaying 6 items.
- 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)
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029) (← links)
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
- Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)