A heuristic algorithm based on Lagrangian relaxation for the closest string problem

DOI10.1016/j.cor.2011.06.005zbMath1251.90288OpenAlexW2163516551MaRDI QIDQ1762029

Shunji Tanaka

Publication date: 15 November 2012

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

Full work available at URL: http://hdl.handle.net/2433/143685

zbMATH Keywords

Lagrangian relaxationtabu searchmixed-integer programmingclosest string problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40)

Related Items (5)

The selective fixing algorithm for the closest string problem ⋮ 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 ⋮ Matheuristics: survey and synthesis ⋮ On the role of metaheuristic optimization in bioinformatics

Uses Software

• Tabu search

Cites Work

• On covering problems of codes
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Center and distinguisher for strings with unbounded alphabet
• A user's guide to tabu search
• A parallel multistart algorithm for the closest string problem
• Optimal Solutions for the Closest-String Problem via Integer Programming
• On the closest string and substring problems
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems

This page was built for publication: A heuristic algorithm based on Lagrangian relaxation for the closest string problem