Pages that link to "Item:Q2047220"
From MaRDI portal
The following pages link to A new polynomially solvable class of quadratic optimization problems with box constraints (Q2047220):
Displaying 8 items.
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- A polynomial case of the cardinality-constrained quadratic optimization problem (Q2393087) (← links)
- (Q4795625) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Box-inequalities for quadratic assignment polytopes (Q5955568) (← links)