A note on submodularity preserved involving the rank functions

DOI10.1007/s40305-019-00255-yzbMath1438.52032OpenAlexW2951607788MaRDI QIDQ2326075

Zhenning Zhang, Min Li, Dong-lei Du, Da-Chuan Xu

Publication date: 4 October 2019

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-019-00255-y

zbMATH Keywords

submodular functiongamematroidrank functionconvex closure

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27)

Related Items (1)

A constrained two-stage submodular maximization

Cites Work

• Unnamed Item
• On cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria
• Shapley's conjecture on the cores of abstract market games
• Polymatroid Optimization, Submodularity, and Joint Replenishment Games
• Discrete Convex Analysis

This page was built for publication: A note on submodularity preserved involving the rank functions