Pages that link to "Item:Q1897348"
From MaRDI portal
The following pages link to A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348):
Displaying 6 items.
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Tensors in computations (Q5887832) (← links)