Pages that link to "Item:Q925231"
From MaRDI portal
The following pages link to New bounds on the unconstrained quadratic integer programming problem (Q925231):
Displaying 5 items.
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
