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 13 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)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- A continuous method for computing bounds in integer quadratic optimization problems (Q1200629) (← 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)
- A new algorithm for quadratic integer programming problems with cardinality constraint (Q2174794) (← links)
- Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
- A note on approximating quadratic programming with rank constraint (Q2903138) (← links)
- Une borne optimale pour la programmation entière quasi-convexe (Q3136700) (← links)
- A polynomial case of unconstrained zero-one quadratic optimization (Q5955560) (← links)