A branch-and-cut approach to the repetition-free longest common subsequence problem
From MaRDI portal
Publication:2883608
DOI10.1016/j.endm.2010.05.067zbMath1237.90167MaRDI QIDQ2883608
Christian Tjandraatmadja, Carlos E. Ferreira
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.067
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
Related Items
Repetition-free longest common subsequence of random sequences, The constrained shortest common supersequence problem, Comparing incomplete sequences via longest common subsequence
Cites Work