GILLIS, Nicolas; GLINEUR, François - Center for Operations Research and Econometrics (CORE), … - 2009
, improving the part-based decomposition. Although NMU is NP-hard (which we prove using its equivalence with the maximum edge … biclique problem in bipartite graphs), we present two approaches to solve it: a method based on convex reformulations and a …