Pages that link to "Item:Q716344"
From MaRDI portal
The following pages link to Exact algorithm and heuristic for the closest string problem (Q716344):
Displayed 6 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)
- Improved LP-based algorithms for the closest string problem (Q1762033) (← links)
- LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- Application of negative learning ant colony optimization to the far from most string problem (Q6149093) (← links)