New Modeling Ideas for the Exact Solution of the Closest String Problem

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...

Full description

Saved in:
Bibliographic Details
Published inDatabase and Expert Systems Applications Vol. 903; pp. 105 - 114
Main Authors Dalpasso, Marcello, Lancia, Giuseppe
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2018
Springer International Publishing
SeriesCommunications in Computer and Information Science
Subjects
Closest String Problem
Dynamic programming
Integer Linear Programming
Parametrized complexity
Online AccessGet full text
ISBN9783319991320
3319991329
ISSN1865-0929
1865-0937
DOI10.1007/978-3-319-99133-7_8

Cover

More Information
Summary: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.
ISBN:9783319991320
3319991329
ISSN:1865-0929
1865-0937
DOI:10.1007/978-3-319-99133-7_8