Optimality criterion for a class of nonlinear integer programs.

DOI10.1016/j.orl.2003.11.007zbMath1054.90049OpenAlexW2063755475MaRDI QIDQ703262

Kazuo Murota, Robert Weismantel, Hiroo Saito

Publication date: 11 January 2005

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

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

zbMATH Keywords

Hilbert basesOptimality criterion

Mathematics Subject Classification ID

Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46)

Related Items

A polynomial oracle-time algorithm for convex integer minimization ⋮ \(n\)-fold integer programming in cubic time ⋮ Graver basis and proximity techniques for block-structured separable convex integer minimization problems ⋮ Vector and matrix apportionment problems and separable convex integer optimization ⋮ Optimality criterion for a class of nonlinear integer programs. ⋮ Cone superadditivity of discrete convex functions ⋮ On test sets for nonlinear integer maximization ⋮ Lower bounds on the graver complexity of \(M\)-fold matrices

Cites Work

• Optimality criterion for a class of nonlinear integer programs.
• Test sets of integer programs
• A primal all-integer algorithm based on irreducible solutions
• On the foundations of linear and integer linear programming I
• Unnamed Item
• Unnamed Item
• Unnamed Item