A continuous characterization of the maximum-edge biclique problem

DOI10.1007/s10898-013-0053-2zbMath1305.90349OpenAlexW2120012120MaRDI QIDQ742133

Nicolas Gillis, François Glineur

Publication date: 18 September 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0053-2

zbMATH Keywords

algorithmic complexitybiclique finding algorithmmaximum-edge biclique problemnonnegative rank-one approximation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, The Bipartite QUBO, Descent Methods for Nonnegative Matrix Factorization, Unnamed Item, Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization, Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation, Global convergence of modified multiplicative updates for nonnegative matrix factorization, Maximum Edge Bicliques in Tree Convex Bipartite Graphs, An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices, A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization, A continuous characterization of the maximum-edge biclique problem, Rethinking arithmetic for deep neural networks

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Consensus algorithms for the generation of all maximal bicliques
• A continuous characterization of the maximum-edge biclique problem
• Evolution towards the maximum clique
• The maximum edge biclique problem is NP-complete
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Continuous Characterizations of the Maximum Clique Problem
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Benchmarking optimization software with performance profiles.