BICLIQUE COMPLETION PROBLEM: MODELS AND ALGORITHMS

[1]  Jinyan Li,et al.  Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications , 2008, SDM.

[2]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3]  G. Nemhauser,et al.  Integer Programming , 2020 .

[4]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[5]  Michalis Faloutsos,et al.  Aggregated Multicast for Scalable QoS Multicast Provisioning , 2001, IWDC.

[6]  Mario Gerla,et al.  Aggregated Multicast – A Comparative Study , 2002, Cluster Computing.

[7]  René Peeters,et al.  The maximum edge biclique problem is NP-complete , 2003, Discret. Appl. Math..

[8]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[9]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[10]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[11]  Pierre Hansen,et al.  First vs. best improvement: An empirical study , 1999, Discret. Appl. Math..

[12]  Doina Bein,et al.  Clustering and the Biclique Partition Problem , 2008, HICSS.

[13]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[14]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[15]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

[16]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[17]  Alain Hertz,et al.  Variable space search for graph coloring , 2006, Discret. Appl. Math..

[18]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[19]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[20]  Celso C. Ribeiro,et al.  Variable neighborhood search for the degree-constrained minimum spanning tree problem , 2002, Discret. Appl. Math..

[21]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[22]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[23]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[24]  A. Guitton,et al.  Scalable tree aggregation for multicast , 2005, Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005..

[25]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .

[26]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system , 1997, Discret. Math..

[27]  Stefano Gualandi.  k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach , 2009, CPAIOR.

[28]  Francis Sourd,et al.  Biclique completion problems for multicast network design , 2007, Discret. Optim..

[29]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..