most citedComputing The Extension Complexities of All 4-Dimensional 0/1-Polytopes

5 citations · 5 across the 3 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2023

Algorithms for Boolean Matrix Factorization using Integer Programming

Christos Kolomvakis, Arnaud Vandaele, Nicolas Gillis

Boolean matrix factorization (BMF) approximates a given binary input matrix as the product of two smaller binary factors. As opposed to binary matrix factorization which uses stand…