Improved LP-based algorithms for the closest string problem
From MaRDI portal
Publication:1762033
Recommendations
- Exact algorithm and heuristic for the closest string problem
- The selective fixing algorithm for the closest string problem
- Improved optimization modelling for the closest string and related problems
- Optimal solutions for the closest-string problem via integer programming
- A combined greedy-walk heuristic and simulated annealing approach for the closest string problem
Cites work
Cited in
(9)- Heuristic approaches to the distinguishing substring selection problem
- An improved algorithm for solving the banded cyclic string-to-string correction problem
- An exact approach for the 0-1 knapsack problem with setups
- LP-based heuristics for the distinguishing string and substring selection problems
- A combined greedy-walk heuristic and simulated annealing approach for the closest string problem
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- An improved integer linear programming formulation for the closest 0-1 string problem
- Improved optimization modelling for the closest string and related problems
- The selective fixing algorithm for the closest string problem
This page was built for publication: Improved LP-based algorithms for the closest string problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762033)