Pages that link to "Item:Q2369979"

The following pages link to Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979):

Displaying 9 items.

• On duality gap in binary quadratic programming (Q454277) (← links)
• A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
• The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
• Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← 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)
• The Bipartite QUBO (Q5050150) (← links)