Factorized binary polynomial optimization
From MaRDI portal
Cites work
- A new polynomially solvable class of quadratic optimization problems with box constraints
- A polyhedral study of binary polynomial programs
- A polynomial case of unconstrained zero-one quadratic optimization
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Berge-acyclic multilinear 0-1 optimization problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constructing Arrangements of Lines and Hyperplanes with Applications
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- Low-rank matrix approximation with weights or missing data is NP-hard
- LP formulations for polynomial optimization problems
- Maximizing the Product of Two Linear Functions In 0-1 Variables
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- On decomposability of multilinear sets
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Optimal factorization of three-way binary data using triadic concepts
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Rank-one Boolean tensor factorization and the multilinear polytope
- Some simplified NP-complete graph problems
- Sparse PCA on fixed-rank matrices
- Subset selection in sparse matrices
- Sums of squares, moment matrices and optimization over polynomials
- Systems of distinct representatives and linear algebra
- Tensor rank is NP-complete
- The basic algorithm for pseudo-Boolean programming revisited
- The bipartite QUBO
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- The multilinear polytope for acyclic hypergraphs
- The Running Intersection Relaxation of the Multilinear Polytope
- The unconstrained binary quadratic programming problem: a survey
- Treewidth computations. II. Lower bounds
This page was built for publication: Factorized binary polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349081)
