The efficient minimization of quadratic polynomials depending on integer variables, with quadratic monomials b^2_i,j(x_i - x_j)^2

MaRDI QIDQ3621050zbMATH OpenFDO

Authors Boris A. Zalesky

Publication date 14 April 2009

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10)

Recommendations

• Integer quadratic programming in the plane
• Minimizing cubic and homogeneous polynomials over integers in the plane
• scientific article; zbMATH DE number 3914086
• scientific article; zbMATH DE number 3847216
• The quadratic Graver cone, quadratic integer minimization, and extensions

Cited in

(4)

• The quadratic Graver cone, quadratic integer minimization, and extensions
• Minimizing cubic and homogeneous polynomials over integers in the plane
• Monomials in quadratic forms
• Integer quadratic programming in the plane

This page was built for publication: The efficient minimization of quadratic polynomials depending on integer variables, with quadratic monomials \(b^2_{i,j}(x_i - x_j)^2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621050)