Allocation under a general substitution structure

DOI10.1016/J.EJOR.2019.02.049MaRDI QIDQ1737487zbMATH OpenOpenAlexFDO

Authors Xianqiang Yang

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

zbMATH Keywords

allocationinventoryMonge sequencessubstitutiontransportation problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Recommendations

• Single-period multiproduct inventory models with substitution
• Assortment planning and inventory decisions under stockout-based substitution
• Dynamic capacity management with substitution
• Deterministic hierarchical substitution inventory models
• Stocking Retail Assortments Under Dynamic Consumer Substitution

Cites work

• A classification of the literature on the planning of substitutable products
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A general class of greedily solvable linear programs
• An algorithm for the detection and construction of Monge sequences
• Deterministic Approximations to Co-Production Problems with Service Constraints and Random Yields
• Dynamic capacity management with substitution
• scientific article; zbMATH DE number 432782 (Why is no real title available?)
• scientific article; zbMATH DE number 6118218 (Why is no real title available?)
• scientific article; zbMATH DE number 3272833 (Why is no real title available?)
• scientific article; zbMATH DE number 3099866 (Why is no real title available?)
• Maximal Flow Through a Network
• Maximum Flow in Planar Networks
• Minimum-cost flow algorithms: an experimental evaluation
• Monge properties, discrete convexity and applications
• Monge sequences, antimatroids, and the transportation problem with forbidden arcs
• Perspectives of Monge properties in optimization
• Random yield and random demand in a production system with downward substitution
• Single-period multiproduct inventory models with substitution
• The assignment problem with nearly Monge arrays and incompatible partner indices

Cited in

(6)

• Production/inventory competition between firms with fixed-proportions co-production systems
• Dynamic capacity management with substitution
• Technical note -- A Monge sequence-based approach to characterize the competitive newsvendor problem
• Pexider's equation and aggregation of allocations
• Inventory allocation with full downward substitution and monotone cost differences
• Online or offline: channel priority for a dual-channel supply chain under demand and yield uncertainties

Describes a project that uses

Uses Software

• CS2

This page was built for publication: Allocation under a general substitution structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1737487)