论文标题
混合整数编程，用于搜索最大的准纤维
Mixed Integer Programming for Searching Maximum Quasi-Bicliques
论文作者
论文摘要
本文与在二分图（Bigraph）中查找最大的准二液体的问题有关。 Bigraph中的准比式是其“几乎”完整的子图。可以多样地理解完整性的放松； here, we assume that the subgraph is a $γ$-quasi-biclique if it lacks a certain number of edges to form a biclique such that its density is at least $γ\in (0,1]$. For a bigraph and fixed $γ$, the problem of searching for the maximal quasi-biclique consists of finding a subset of vertices of the bigraph such that the induced subgraph is a对于给定的图形，基于混合整数编程（MIP）的几个模型，用于搜索准乘型的替代效率，并测试了Quasirique the Quasiriquie and-dyte dosim，Quasi-biclique及其大小是最大的。 triclustering \ textsc {tribox}。
This paper is related to the problem of finding the maximal quasi-bicliques in a bipartite graph (bigraph). A quasi-biclique in the bigraph is its "almost" complete subgraph. The relaxation of completeness can be understood variously; here, we assume that the subgraph is a $γ$-quasi-biclique if it lacks a certain number of edges to form a biclique such that its density is at least $γ\in (0,1]$. For a bigraph and fixed $γ$, the problem of searching for the maximal quasi-biclique consists of finding a subset of vertices of the bigraph such that the induced subgraph is a quasi-biclique and its size is maximal for a given graph. Several models based on Mixed Integer Programming (MIP) to search for a quasi-biclique are proposed and tested for working efficiency. An alternative model inspired by biclustering is formulated and tested; this model simultaneously maximizes both the size of the quasi-biclique and its density, using the least-square criterion similar to the one exploited by triclustering \textsc{TriBox}.
