Inventory allocation with full downward substitution and monotone cost differences

DOI10.1016/j.ejor.2022.08.027OpenAlexW4293032646MaRDI QIDQ6106969

No author found.

Publication date: 3 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.08.027

zbMATH Keywords

algorithmsinventorytransportation problemsubstitutionMonge sequences

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A classification of the literature on the planning of substitutable products
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
• An algorithm for the detection and construction of Monge sequences
• Allocation under a general substitution structure
• Perspectives of Monge properties in optimization
• Monge properties, discrete convexity and applications
• Random Yield and Random Demand in a Production System with Downward Substitution
• Single-Period Multiproduct Inventory Models with Substitution
• Minimum-cost flow algorithms: an experimental evaluation
• Dynamic Capacity Management with Substitution
• Encouraging Cooperation in Sharing Supermodular Costs

This page was built for publication: Inventory allocation with full downward substitution and monotone cost differences