Cone superadditivity of discrete convex functions
type: Item
instance of: scholarly article
title: Cone superadditivity of discrete convex functions
zbMATH Open document ID: 1267.90073
author: Yusuke Kobayashi
author: Kazuo Murota
author: Robert Weismantel
published in: Mathematical Programming. Series A. Series B
publication date: 2012-10-15T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 52A41
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6093769
zbMATH Keywords: discrete convex function
zbMATH Keywords: superadditivity
zbMATH Keywords: integer programming
zbMATH Keywords: optimality criterion
zbMATH Keywords: Hilbert bases
MaRDI profile type: Publication
full work available at URL: s10107-011-0447-1
OpenAlex ID: W2034902505
cites work: Q3056948
cites work: Submodular functions and optimization.
cites work: Notes on L-/M-convex functions and the separation theorems
cites work: On the foundations of linear and integer linear programming I
cites work: A primal all-integer algorithm based on irreducible solutions
cites work: A polynomial oracle-time algorithm for convex integer minimization
cites work: \(M\)-convex functions and tree metrics
cites work: On test sets for nonlinear integer maximization
cites work: Convexity and Steinitz's exchange property
cites work: Discrete convex analysis
cites work: Discrete Convex Analysis
cites work: Optimality criterion for a class of nonlinear integer programs.
cites work: \(M\)-convex function on generalized polymatroid
cites work: Extension of M-convexity and L-convexity to polyhedral convex functions
cites work: Conjugacy relationship between M-convex and L-convex functions in continuous variables
cites work: Q4477738
cites work: Test sets of integer programs
DOI: 10.1007/S10107-011-0447-1
description: scientific article; zbMATH DE number 6093769