The bipartite Boolean quadric polytope
From MaRDI portal
Publication:2673249
DOI10.1016/J.DISOPT.2021.100657OpenAlexW3187519750MaRDI QIDQ2673249FDOQ2673249
Authors: Piyashat Sripratak, Abraham P. Punnen, Tamon Stephen 
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
Recommendations
- The Boolean quadric polytope
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- A note on the Boolean quadric polytope
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The cut polytope and the Boolean quadric polytope
- scientific article; zbMATH DE number 4185387
- The biclique partitioning polytope
- On The Boolean Quadric Forest Polytope
- Cardinality constrained Boolean quadratic polytope
- scientific article; zbMATH DE number 4131953
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Pseudo-Boolean optimization
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- A computational study on the quadratic knapsack problem with multiple constraints
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Solving mixed integer bilinear problems using MILP formulations
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Low-rank matrix approximation with weights or missing data is NP-hard
- Approximating the cut-norm via Grothendieck's inequality
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- The Rank-One Quadratic Assignment Problem
- Markov chain methods for the bipartite Boolean quadratic programming problem
- The bilinear assignment problem: complexity and polynomially solvable special cases
- Enumeration of the facets of cut polytopes over some highly symmetric graphs
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
Cited In (12)
- The cut polytope and the Boolean quadric polytope
- A polyhedral approach for a constrained quadratic 0-1 problem
- The bipartite QUBO
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- Relaxations and cutting planes for linear programs with complementarity constraints
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- \(k\)-neighborly faces of the Boolean quadric polytopes
- Shortest Paths in Graphs of Convex Sets
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- On integer recognition over some Boolean quadric polytope extension
- On The Boolean Quadric Forest Polytope
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
Uses Software
This page was built for publication: The bipartite Boolean quadric polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673249)
