Optimum Solution of the Closest String Problem via Rank Distance

DOI10.1007/978-3-319-45587-7_26zbMath1445.68363OpenAlexW2513478613MaRDI QIDQ2835685

Mara Servilio, Claudio Arbib, Giovanni Felici, Paolo Ventura

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_26

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Cites Work

• The selective fixing algorithm for the closest string problem
• An improved integer linear programming formulation for the closest 0-1 string problem
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• On the Closest String via Rank Distance
• Scheduling two chains of unit jobs on one machine: A polyhedral study
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Solving Mixed Integer Programming Problems Using Automatic Reformulation

This page was built for publication: Optimum Solution of the Closest String Problem via Rank Distance