Cone superadditivity of discrete convex functions

DOI10.1007/s10107-011-0447-1zbMath1267.90073MaRDI QIDQ715073

Kazuo Murota, Yusuke Kobayashi, Robert Weismantel

Publication date: 15 October 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0447-1

zbMATH Keywords

integer programming; superadditivity; optimality criterion; Hilbert bases; discrete convex function

Mathematics Subject Classification ID

90C10: Integer programming

90C30: Nonlinear programming

52A41: Convex functions and convex programs in convex geometry

Related Items

\(n\)-fold integer programming in cubic time

Cites Work

• A polynomial oracle-time algorithm for convex integer minimization
• Convexity and Steinitz's exchange property
• Optimality criterion for a class of nonlinear integer programs.
• On test sets for nonlinear integer maximization
• Discrete convex analysis
• Test sets of integer programs
• A primal all-integer algorithm based on irreducible solutions
• Notes on L-/M-convex functions and the separation theorems
• Conjugacy relationship between M-convex and L-convex functions in continuous variables
• \(M\)-convex functions and tree metrics
• Extension of M-convexity and L-convexity to polyhedral convex functions
• Submodular functions and optimization.
• M-Convex Function on Generalized Polymatroid
• On the foundations of linear and integer linear programming I
• Discrete Convex Analysis
• Unnamed Item
• Unnamed Item