The bipartite Boolean quadric polytope (Q2673249)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The bipartite Boolean quadric polytope	scientific article

Statements

scholarly article

0 references

The bipartite Boolean quadric polytope (English)

0 references

Piyashat Sripratak

0 references

Abraham P. Punnen

0 references

0 references

Discrete Optimization

0 references

publication date

9 June 2022

0 references

zbMATH Keywords

quadratic programming

0 references

0-1 variables

0 references

polytope

0 references

valid inequalities

0 references

Boolean quadric polytope

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disopt.2021.100657

0 references

Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard

0 references

Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis

0 references

Approximating the cut-norm via Grothendieck's inequality

0 references

Pseudo-Boolean optimization

0 references

The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases

0 references

The Boolean quadratic polytope: Some characteristics, facets and relatives

0 references

A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope

0 references

The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations

0 references

Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

0 references

Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes

0 references

Solving Mixed Integer Bilinear Problems Using MILP Formulations

0 references

A computational study on the quadratic knapsack problem with multiple constraints

0 references

The bilinear assignment problem: complexity and polynomially solvable special cases

0 references

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms

0 references

The Rank-One Quadratic Assignment Problem

0 references

Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem

0 references

Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs

0 references

Markov chain methods for the bipartite Boolean quadratic programming problem

0 references

Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms

0 references

Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking

0 references

0 references

New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities

0 references

Enumeration of the facets of cut polytopes over some highly symmetric graphs

0 references

Identifiers

10.1016/j.disopt.2021.100657

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2673249

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2673249&oldid=36814391"