LP-based heuristics for the distinguishing string and substring selection problems

DOI10.1007/s10479-021-04138-5zbMath1501.90051OpenAlexW3171658156MaRDI QIDQ2675721

Jean Torres, Edna A. Hoshino

Publication date: 26 September 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04138-5

zbMATH Keywords

matheuristicvariable neighbourhood searchdistinguishing string selection problemdistinguishing substring selection problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• SCIP
• CPLEX
• GitHub

Cites Work

• Exact algorithm and heuristic for the closest string problem
• Variable neighbourhood search: Methods and applications
• Distinguishing string selection problems.
• Improved LP-based algorithms for the closest string problem
• Heuristic approaches to the distinguishing substring selection problem
• Parameterized intractability of distinguishing substring selection
• Genetic Design of Drugs Without Side-Effects
• A Closer Look at the Closest String and Closest Substring Problem

This page was built for publication: LP-based heuristics for the distinguishing string and substring selection problems