Heuristic approaches to the distinguishing substring selection problem

DOI10.1016/j.endm.2018.03.020zbMath1408.90351OpenAlexW2798242877MaRDI QIDQ1791942

Edna A. Hoshino, Emerson Silva, Jean Torres

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.020

zbMATH Keywords

integer programmingvariable neighborhood searchrounding heuristic

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• SCIP
• CPLEX

Cites Work

• Unnamed Item
• Variable neighbourhood search: Methods and applications
• Improved LP-based algorithms for the closest string problem
• A Closer Look at the Closest String and Closest Substring Problem

This page was built for publication: Heuristic approaches to the distinguishing substring selection problem