An improved integer linear programming formulation for the closest 0-1 string problem

DOI10.1016/j.cor.2016.11.019zbMath1391.90419OpenAlexW2550309052MaRDI QIDQ1652195

Paolo Ventura, Claudio Arbib, Mara Servilio

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.019

zbMATH Keywords

branch-and-cutclosest string problemcontinuous relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Optimum Solution of the Closest String Problem via Rank Distance

Cites Work

• Unnamed Item
• The selective fixing algorithm for the closest string problem
• Exact algorithm and heuristic for the closest string problem
• A GRASP algorithm for the closest string problem using a probability-based heuristic
• A heuristic algorithm based on Lagrangian relaxation for the closest string problem
• Improved LP-based algorithms for the closest string problem
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• A parallel multistart algorithm for the closest string problem
• Finding similar regions in many strings
• A Closer Look at the Closest String and Closest Substring Problem

This page was built for publication: An improved integer linear programming formulation for the closest 0-1 string problem