In this paper we consider the exact solution of the closest string problem (CSP). In general, exact algorithms for an NP-hard problem are either branch and bound procedures or dynamic programs. With respect to branch and bound, we give a new Integer Linear Programming formulation, improving over the standard one, and also suggest some combinatorial lower bounds for a possible non-ILP branch and bound approach. Furthermore, we describe the first dynamic programming procedure for the CSP.
CITATION STYLE
Dalpasso, M., & Lancia, G. (2018). New modeling ideas for the exact solution of the closest string problem. In Communications in Computer and Information Science (Vol. 903, pp. 105–114). Springer Verlag. https://doi.org/10.1007/978-3-319-99133-7_8
Mendeley helps you to discover research relevant for your work.