Polymatroid Optimization, Submodularity, and Joint Replenishment Games

DOI10.1287/opre.1110.1000zbMath1245.90123OpenAlexW2096320153MaRDI QIDQ2892220

Simai He, Jia-Wei Zhang, Shu-Zhong Zhang

Publication date: 18 June 2012

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/038f5171b207c83c65a75edb2fdc802f6d26b35b

zbMATH Keywords

joint replenishment problempolymatroid optimizationseparable concave function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Cooperative games (91A12)

Related Items (7)

On a Reduction for a Class of Resource Allocation Problems ⋮ Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ Competitive contract design in a retail supply chain under demand uncertainty ⋮ On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ Dynamic linear programming games with risk-averse players ⋮ A note on submodularity preserved involving the rank functions

This page was built for publication: Polymatroid Optimization, Submodularity, and Joint Replenishment Games