Maximizing the Product of Two Linear Functions In 0-1 Variables
From MaRDI portal
Recommendations
Cited in
(13)- Minimization of ordered, symmetric half-products
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- On the complexity and approximation of the maximum expected value all-or-nothing subset
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- A polytope for a product of real linear functions in 0/1 variables
- Base-2 expansions for linearizing products of functions of discrete variables
- Complexity and polynomially solvable special cases of QUBO
- Method of solution of extremal combinatorial problems with nonlinear structure
- scientific article; zbMATH DE number 6438525 (Why is no real title available?)
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
This page was built for publication: Maximizing the Product of Two Linear Functions In 0-1 Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150259)