Polymatroid optimization, submodularity, and joint replenishment games

DOI10.1287/OPRE.1110.1000MaRDI QIDQ2892220zbMATH OpenOpenAlexFDO

Authors Simai He, Jiawei Zhang, Shuzhong 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)

Recommendations

• Cost allocation for joint replenishment models
• The submodular joint replenishment problem
• The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model
• On the core of ordered submodular cost games
• Submodularity of some classes of the combinatorial optimization games

Cited in

(9)

• A note on submodularity preserved involving the rank functions
• 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
• Sensitivity analysis for convex separable optimization over integral polymatroids
• On a Reduction for a Class of Resource Allocation Problems
• Dynamic linear programming games with risk-averse players
• Competitive contract design in a retail supply chain under demand uncertainty
• A differentially private approximation algorithm for submodular maximization under a polymatroid constraint over the integer lattice
• Maximizing the difference of DR-submodular function on the integer lattice

This page was built for publication: Polymatroid optimization, submodularity, and joint replenishment games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892220)