Pages that link to "Item:Q2786313"
From MaRDI portal
The following pages link to Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313):
Displaying 4 items.
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- An exact penalty function method for nonlinear mixed discrete programming problems (Q1936789) (← links)
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
- A graph-based decomposition method for convex quadratic optimization with indicators (Q6102761) (← links)