Pages that link to "Item:Q3150259"
From MaRDI portal
The following pages link to Maximizing the Product of Two Linear Functions In 0-1 Variables (Q3150259):
Displaying 10 items.
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
- On the complexity and approximation of the maximum expected value all-or-nothing subset (Q2192058) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
