The warehouse-retailer network design game
From MaRDI portal
Publication:2514656
DOI10.3934/JIMO.2015.11.291zbMATH Open1305.90418OpenAlexW2329740905MaRDI QIDQ2514656FDOQ2514656
Authors: Jiating Shao, Wen-Qing Xu, Gai-Di Li, Dachuan Xu
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- Geometric algorithms and combinatorial optimization
- Warehouse-Retailer Network Design Problem
- Cooperative facility location games
- Applications of approximation algorithms to cooperative games
- Cost allocation for joint replenishment models
- Stochastic Transportation-Inventory Network Design Problem
- 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
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
- Inventory Cost Effect of Consolidating Several One-Warehouse Multiretailer Systems
- Limitations of cross-monotonic cost sharing schemes
Cited In (3)
This page was built for publication: The warehouse-retailer network design game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514656)