Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
Year of publication: |
16 September 2018
|
---|---|
Authors: | Zhou, Yi ; Rossi, André ; Hao, Jin-Kao |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 269.2018, 3 (16.9.), p. 834-843
|
Subject: | Combinatorial optimization | Clique | Exact algorithms | Techniques for tight bounds | Mathematical formulation | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Mathematik | Mathematics | Tourenplanung | Vehicle routing problem |
-
Kulich, Miroslav, (2022)
-
Liang, Yile, (2024)
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
- More ...
-
Ma, Mengfan, (2023)
-
Computing maximum k-defective cliques in massive graphs
Chen, Xiaoyu, (2021)
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
- More ...