Pages that link to "Item:Q1193723"
From MaRDI portal
The following pages link to A solvable class of quadratic 0-1 programming (Q1193723):
Displaying 13 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)
- On lower bounds for a class of quadratic 0,1 programs (Q1072937) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)