Improved LP-based algorithms for the closest string problem

DOI10.1016/j.cor.2011.06.010zbMath1251.90278OpenAlexW2085223058MaRDI QIDQ1762033

Fabio Salassa, Frederico Della Croce

Publication date: 15 November 2012

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

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

zbMATH Keywords

heuristicsclosest string problemcore problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40)

Related Items (6)

The selective fixing algorithm for the closest string problem ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ An improved integer linear programming formulation for the closest 0-1 string problem ⋮ A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem ⋮ LP-based heuristics for the distinguishing string and substring selection problems ⋮ Heuristic approaches to the distinguishing substring selection problem

Cites Work

• Exact algorithm and heuristic for the closest string problem
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• A Closer Look at the Closest String and Closest Substring Problem

This page was built for publication: Improved LP-based algorithms for the closest string problem