Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming.

Melih Sözdinler Can C. Özturan

Published in: CSE (2018)

Keyphrases

integer programming
bipartite networks
np hard
linear programming
constraint programming
column generation
lagrangian relaxation
cutting plane
integer program
set partitioning
valid inequalities
cutting plane algorithm
integer programming formulations
text mining
community detection