The warehouse-retailer network design game

DOI10.3934/jimo.2015.11.291zbMath1305.90418MaRDI QIDQ2514656

Wen-Qing Xu, Jiating Shao, Da-Chuan Xu, Gai-Di Li

Publication date: 3 February 2015

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2015.11.291

zbMATH Keywords

cost-sharing method; approximate cost recovery; warehouse-retailer network design

Mathematics Subject Classification ID

90C10: Integer programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Design of a single window system for e-government services: the Chilean case, Bundling and pricing decisions for bricks-and-clicks firms with consideration of network externality

Cites Work

• Unnamed Item
• Geometric algorithms and combinatorial optimization
• A push-relabel framework for submodular function minimization and applications to parametric optimization
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A cross-monotonic cost-sharing scheme for the concave facility location game
• The \(k\)-level facility location game
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Inventory Cost Effect of Consolidating Several One-Warehouse Multiretailer Systems
• Warehouse-Retailer Network Design Problem
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• Cooperative facility location games
• Applications of approximation algorithms to cooperative games
• Cost Allocation for Joint Replenishment Models
• Stochastic Transportation-Inventory Network Design Problem
• Strategyproof sharing of submodular costs: budget balance versus efficiency