On test sets for nonlinear integer maximization

DOI10.1016/J.ORL.2008.02.002MaRDI QIDQ1003492zbMATH OpenOpenAlexFDO

Authors Jon Lee, Shmuel Onn, Robert Weismantel

Publication date 4 March 2009

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2008.02.002

zbMATH Keywords

integer programmingtest setsHilbert basissuperadditiveGordan Lemma

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• An improved test set approach to nonlinear integer problems with applications to engineering design
• Test sets and inequalities for integer programs
• Finding multiple solutions in nonlinear integer programming with algebraic test-sets
• Test sets for integer programs
• Finding multiplies solutions for non-linear integer programming

Cites work

• On the foundations of linear and integer linear programming I
• Optimality criterion for a class of nonlinear integer programs.

Cited in

(10)

• Solving MIPs via scaling-based augmentation
• An improved test set approach to nonlinear integer problems with applications to engineering design
• Expected Frobenius numbers
• When is rounding allowed in integer nonlinear optimization?
• Test sets for integer programs
• scientific article; zbMATH DE number 4204116 (Why is no real title available?)
• Cone superadditivity of discrete convex functions
• Parametric nonlinear discrete optimization over well-described sets and matroid intersections
• Finding multiple solutions in nonlinear integer programming with algebraic test-sets
• Finding multiplies solutions for non-linear integer programming

This page was built for publication: On test sets for nonlinear integer maximization

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