Allocation under a general substitution structure
From MaRDI portal
Publication:1737487
DOI10.1016/j.ejor.2019.02.049zbMath1430.90037OpenAlexW2919905259MaRDI QIDQ1737487
Publication date: 23 April 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.02.049
Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items (3)
Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem ⋮ Inventory allocation with full downward substitution and monotone cost differences ⋮ Production/inventory competition between firms with fixed-proportions co-production systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A classification of the literature on the planning of substitutable products
- The assignment problem with nearly Monge arrays and incompatible partner indices
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- An algorithm for the detection and construction of Monge sequences
- Perspectives of Monge properties in optimization
- Monge properties, discrete convexity and applications
- A General Class of Greedily Solvable Linear Programs
- 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
- Maximal Flow Through a Network
- Maximum Flow in Planar Networks
- Deterministic Approximations to Co-Production Problems with Service Constraints and Random Yields
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
This page was built for publication: Allocation under a general substitution structure
