A heuristic algorithm based on Lagrangian relaxation for the closest string problem
type: Item
instance of: scholarly article
title: A heuristic algorithm based on Lagrangian relaxation for the closest string problem
zbMATH Open document ID: 1251.90288
author: Shunji Tanaka
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
full work available at URL: http://hdl.handle.net/2433/143685
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 92C40
zbMATH DE Number: 6107503
zbMATH Keywords: closest string problem
zbMATH Keywords: mixed-integer programming
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: tabu search
describes a project that uses: Tabu search
MaRDI profile type: Publication
OpenAlex ID: W2163516551
cites work: On covering problems of codes
cites work: Center and distinguisher for strings with unbounded alphabet
cites work: On the closest string and substring problems
cites work: Fixed-parameter algorithms for CLOSEST STRING and related problems
cites work: Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
cites work: Optimal solutions for the closest-string problem via integer programming
cites work: A parallel multistart algorithm for the closest string problem
cites work: A user's guide to tabu search
DOI: 10.1016/J.COR.2011.06.005
description: scientific article; zbMATH DE number 6107503