Stock selection heuristics for interdependent items
From MaRDI portal
Publication:1869495
DOI10.1016/S0377-2217(02)00201-1zbMath1011.90001MaRDI QIDQ1869495
James K. Ho, Rangaraja P. Sundarraj, K. Gnanendran
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90B05: Inventory, storage, reservoirs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified greedy heuristic for the set covering problem with improved worst case bound
- A Few Remarks on the Assortment Problem
- An Integer Programming Approach to the Apparel Sizing Problem
- The Discrete Two-Dimensional Assortment Problem
- A Greedy Heuristic for the Set-Covering Problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Design Commonality to Reduce Multi-Item Inventory: Optimal Depth of a Product Line