Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers
The 54th Annual Conference of the Institute of Systems, Control and Information Engineers
Session ID : T351
Conference information

Host: Institute of Systems, Control and Information Engineers

A heuristic algorithm based on Lagrangian relaxation for the closest string problem
*Shunji Tanaka
Author information
Keywords: closest string problem, heuristic algorithm, integer programming problem, Lagrangian relaxation
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
This paper proposes a heuristic algorithm based on Lagrangian relaxation for the closest string problem to find a string that minimizes the maximum Hamming distance from a given set of strings. Numerical experiments will show the effectiveness of the proposed algorithm.
Content from these authors
© 2010 The Institute of Systems, Control and Information Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top