The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
type: Item
instance of: scholarly article
title: The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
zbMATH Open document ID: 1408.90243
author: Yusuke Kobayashi
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6945413
zbMATH Keywords: \(M^{\natural}\)-convex set functions
zbMATH Keywords: DC programming
zbMATH Keywords: matroid
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: j.orl.2015.08.011
OpenAlex ID: W1236105380
cites work: Valuated matroids
cites work: Submodular functions and optimization.
cites work: A framework of discrete DC programming by discrete convex analysis
cites work: Q2999658
cites work: \(M\)-convex function on generalized polymatroid
DOI: 10.1016/J.ORL.2015.08.011
description: scientific article; zbMATH DE number 6945413