On test sets for nonlinear integer maximization

DOI10.1016/j.orl.2008.02.002zbMath1155.90434OpenAlexW2040083156MaRDI QIDQ1003492

Jon Lee, Robert Weismantel, Shmuel Onn

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 programmingHilbert basistest setssuperadditiveGordan Lemma

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Parametric nonlinear discrete optimization over well-described sets and matroid intersections, Solving MIPs via scaling-based augmentation, Expected Frobenius numbers, Cone superadditivity of discrete convex functions, When is rounding allowed in integer nonlinear optimization?

Cites Work

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