We present algorithms for enumerating all maximal biclusters in numerical datasets.

They are the first ones in the literature with polynomial time per pattern.

The enumeration is efficient, complete, correct and non-redundant.

The experiments emphasize the relevance of enumerative approaches over heuristics.

Our family of algorithms is ready for practical applications requiring enumeration.