Convex analysis and duality over discrete domains
type: Item
instance of: scholarly article
title: Convex analysis and duality over discrete domains
zbMATH Open document ID: 1413.90184
author: Shu-Cherng Fang
author: Murat Adivar
published in: Journal of the Operations Research Society of China
publication date: 2018-08-15T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6918754
zbMATH Keywords: discrete convex analysis
zbMATH Keywords: discrete Lagrangian duality
zbMATH Keywords: discrete Slater's condition
zbMATH Keywords: discrete strong duality
zbMATH Keywords: integer programming
zbMATH Keywords: integrality
MaRDI profile type: Publication
full work available at URL: s40305-017-0158-2
OpenAlex ID: W2598386307
cites work: On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
cites work: Convexity and Steinitz's exchange property
cites work: Discrete convex analysis
cites work: \(M\)-convex function on generalized polymatroid
cites work: Notes on L-/M-convex functions and the separation theorems
cites work: A note on discrete convexity and local optimality
cites work: Convexity in cristallographical lattices
cites work: Q4040221
cites work: Discrete Convex Analysis
cites work: Towards strong duality in integer programming
cites work: Convex optimization on mixed domains
cites work: Q4485837
cites work: Convex Analysis
cites work: Handbook of generalized convexity and generalized monotonicity
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Q4821526
cites work: Q3236252
DOI: 10.1007/S40305-017-0158-2
description: scientific article; zbMATH DE number 6918754