Tight MIP formulations for bounded length cyclic sequences.

Thomas Kalinowski Tomas Lidén Hamish Waterer

Published in: CoRR (2018)

Keyphrases

fixed length
lower bound
finite alphabet
hidden markov models
arbitrary length
mixed integer programming
variable length
upper bound
total length
information systems
worst case
database
column generation
dynamic programming
phylogenetic trees
valid inequalities
evolutionary algorithm