A continuous characterization of the maximum-edge biclique problem
type: Item
instance of: scholarly article
title: A continuous characterization of the maximum-edge biclique problem
zbMATH Open document ID: 1305.90349
author: Nicolas Gillis
author: François Glineur
published in: Journal of Global Optimization
publication date: 2014-09-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6345504
zbMATH Keywords: maximum-edge biclique problem
zbMATH Keywords: biclique finding algorithm
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: nonnegative rank-one approximation
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: s10898-013-0053-2
OpenAlex ID: W2120012120
cites work: Consensus algorithms for the generation of all maximal bicliques
cites work: Evolution towards the maximum clique
cites work: Benchmarking optimization software with performance profiles.
cites work: Continuous Characterizations of the Maximum Clique Problem
cites work: The maximum edge biclique problem is NP-complete
cites work: Q5689624
cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: Q3998482
DOI: 10.1007/S10898-013-0053-2
Recommended article: Continuous Characterizations of the Maximum Clique Problem
Recommended article: Parameterized Algorithms for Maximum Edge Biclique and Related Problems
Recommended article: Finding Maximum Edge Bicliques in Convex Bipartite Graphs
Recommended article: Finding maximum edge bicliques in convex bipartite graphs
Recommended article: Maximum Edge Bicliques in Tree Convex Bipartite Graphs
Recommended article: Maximum weighted edge biclique problem on bipartite graphs
Recommended article: Inapproximability of Maximum Weighted Edge Biclique and Its Applications
Recommended article: The maximum edge biclique problem is NP-complete
Recommended article: A continuous characterization of the maximum vertex-weighted clique in hypergraphs
Recommended article: A convexity upper bound for the number of maximal bicliques of a bipartite graph
description: scientific article; zbMATH DE number 6345504