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

Shunji Tanaka. A heuristic algorithm based on Lagrangian relaxation for the closest string problem. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Istanbul, Turkey, 10-13 October 2010. pages 2780-2786, IEEE, 2010. [doi]

Abstract

Abstract is missing.