A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant

DOI10.1007/978-3-540-78773-0_29zbMath1136.90520OpenAlexW1571879181MaRDI QIDQ5458540

Cristina G. Fernandes, Christian Tjandraatmadja, Yoshiko Wakabayashi, Carlos E. Ferreira

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_29

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (4)

A branch-and-cut approach to the repetition-free longest common subsequence problem ⋮ Variants of constrained longest common subsequence ⋮ A hybrid genetic algorithm for the repetition free longest common subsequence problem ⋮ Repetition-free longest common subsequence

Cites Work

• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• On certain polytopes associated with graphs
• Anti-blocking polyhedra
• Normal hypergraphs and the perfect graph conjecture
• Exemplar Longest Common Subsequence
• Repetition-free longest common subsequence

This page was built for publication: A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant