The bipartite Boolean quadric polytope
From MaRDI portal
Publication:2673249
DOI10.1016/j.disopt.2021.100657OpenAlexW3187519750MaRDI QIDQ2673249
Tamon Stephen, Piyashat Sripratak, Abraham P. Punnen
Publication date: 9 June 2022
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2021.100657
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items
The Bipartite QUBO, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Shortest Paths in Graphs of Convex Sets
Uses Software
Cites Work
- Unnamed Item
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Pseudo-Boolean optimization
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- The bilinear assignment problem: complexity and polynomially solvable special cases
- Markov chain methods for the bipartite Boolean quadratic programming problem
- A computational study on the quadratic knapsack problem with multiple constraints
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Enumeration of the facets of cut polytopes over some highly symmetric graphs
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- Approximating the cut-norm via Grothendieck's inequality
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The Rank-One Quadratic Assignment Problem
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
