Pages that link to "Item:Q3059290"
From MaRDI portal
The following pages link to Polynomially Solvable Cases of Binary Quadratic Programs (Q3059290):
Displayed 7 items.
- On duality gap in binary quadratic programming (Q454277) (← links)
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Distributed resource allocation with binary decisions via Newton-like neural network dynamics (Q2021311) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)