The bipartite Boolean quadric polytope (Q2673249): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2021.100657
+Normal rank
@@ Property / OpenAlex ID @@
+W3187519750
@@ Property / OpenAlex ID: W3187519750 / rank @@
+Normal rank
@@ Property / cites work @@
+Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
+Normal rank
@@ Property / cites work @@
+Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
+Normal rank
@@ Property / cites work @@
+Approximating the cut-norm via Grothendieck's inequality
+Normal rank
@@ Property / cites work @@
+Pseudo-Boolean optimization
@@ Property / cites work: Pseudo-Boolean optimization / rank @@
+Normal rank
@@ Property / cites work @@
+The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
+Normal rank
@@ Property / cites work @@
+The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
+Normal rank
@@ Property / cites work @@
+Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
+Normal rank
@@ Property / cites work @@
+Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
+Normal rank
@@ Property / cites work @@
+Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
+Normal rank
@@ Property / cites work @@
+An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
+Normal rank
@@ Property / cites work @@
+Solving Mixed Integer Bilinear Problems Using MILP Formulations
+Normal rank
@@ Property / cites work @@
+A computational study on the quadratic knapsack problem with multiple constraints
+Normal rank
@@ Property / cites work @@
+The bilinear assignment problem: complexity and polynomially solvable special cases
+Normal rank
@@ Property / cites work @@
+Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+The Rank-One Quadratic Assignment Problem
@@ Property / cites work: The Rank-One Quadratic Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
+Normal rank
@@ Property / cites work @@
+Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
+Normal rank
@@ Property / cites work @@
+Markov chain methods for the bipartite Boolean quadratic programming problem
+Normal rank
@@ Property / cites work @@
+Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
+Normal rank
@@ Property / cites work @@
+Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
+Normal rank
@@ Property / cites work @@
+Q3236252
@@ Property / cites work: Q3236252 / rank @@
+Normal rank
@@ Property / cites work @@
+New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities
+Normal rank
@@ Property / cites work @@
+Enumeration of the facets of cut polytopes over some highly symmetric graphs
+Normal rank