An improved integer linear programming formulation for the closest 0-1 string problem

被引：1
|
作者：
Arbib, Claudio [1 ]
Servilio, Mara [2 ]
Ventura, Paolo [2 ]
机构：
[1] Univ Aquila, Dipartimento Sci Ingn Informaz & Matemat, Via Vetoio, I-67010 Laquila, Italy
[2] Ist Anal Sistemi & Informat A Ruberti CNR, Via Taurini 19, I-00185 Rome, Italy
来源：
COMPUTERS & OPERATIONS RESEARCH | 2017年 / 80卷
关键词：
Closest string problem; Branch-and-cut; Continuous relaxation; ALGORITHM;
D O I：
10.1016/j.cor.2016.11.019
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The Closest String Problem (CSP) calls for finding an n-string that minimizes its maximum Hamming distance from in given n-strings. Recently, integer linear programs (ILP) have been successfully applied within heuristics to improve efficiency and effectiveness. We consider an ILP for the binary case (0-1 CSP) that updates the previous formulations and solve it by branch-and-cut. The method separates in polynomial time the first closure of {0, 1}-Chvatal-Gomory cuts and can either be used stand-alone to find optimal solutions, or as a plug-in to improve heuristics based on the exact solution of reduced problems. Due to the parity structure of the right-hand side, the impressive performances obtained with this method in the binary case cannot be directly replicated in the general case. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码：94 / 100
页数：7
相关论文
共 50 条
12345