On the public citation graph
Revisiting the Joint Assortment and Inventory Problem under Stockout-Based Substitution: Fluid Relaxation and Heuristics
0 signed · 31 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4899-7562-1_8openalex-extracted
Assortment Planning: Review of Literature and Industry Practice
inferredcites →https://doi.org/10.1111/j.1937-5956.2012.01423.xopenalex-extracted
Joint Stocking and Product Offer Decisions Under the Multinomial Logit Model
inferredcites →https://doi.org/10.1111/poms.13742openalex-extracted
Approximation Schemes for the Joint Inventory Selection and Online Resource Allocation Problem
inferredcites →https://doi.org/10.1137/0325033openalex-extracted
Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
inferredcites →https://doi.org/10.1145/3580507.3597773openalex-extracted
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
inferredcites →https://doi.org/10.1287/ijoc.2022.0135openalex-extracted
BilevelJuMP.jl: Modeling and Solving Bilevel Optimization Problems in Julia
inferredcites →https://doi.org/10.1287/mnsc.1060.0580openalex-extracted
Assortment Planning and Inventory Decisions Under a Locational Choice Model
inferredcites →https://doi.org/10.1287/mnsc.2019.3346openalex-extracted
Dynamic Assortment Optimization for Reusable Products with Random Usage Durations
inferredcites →https://doi.org/10.1287/mnsc.2023.4769openalex-extracted
Fluid Approximations for Revenue Management Under High-Variance Demand
inferredcites →https://doi.org/10.1287/mnsc.45.11.1496openalex-extracted
On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
inferredcites →https://doi.org/10.1287/moor.2018.0933openalex-extracted
Approximation Algorithms for Dynamic Assortment Optimization Models
inferredcites →https://doi.org/10.1287/msom.1050.0088openalex-extracted
Retail Assortment Planning in the Presence of Consumer Search
inferredcites →https://doi.org/10.1287/msom.1120.0425openalex-extracted
Fixed vs. Random Proportions Demand Models for the Assortment Planning Problem Under Stockout-Based Substitution
inferredcites →https://doi.org/10.1287/opre.1080.0541openalex-extracted
A Static Approximation for Dynamic Demand Substitution with Applications in a Competitive Market
inferredcites →https://doi.org/10.1287/opre.1090.0805openalex-extracted
Assortment Planning and Inventory Decisions Under Stockout-Based Substitution
inferredcites →https://doi.org/10.1287/opre.2014.1328openalex-extracted
A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice
inferredcites →https://doi.org/10.1287/opre.2015.1450openalex-extracted
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
inferredcites →https://doi.org/10.1287/opre.2017.1628openalex-extracted
Revenue Management Under the Markov Chain Choice Model
inferredcites →https://doi.org/10.1287/opre.2018.1734openalex-extracted
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences
inferredcites →https://doi.org/10.1287/opre.2019.1944openalex-extracted
There's No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
inferredcites →https://doi.org/10.1287/opre.2019.1957openalex-extracted
Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
inferredcites →https://doi.org/10.1287/opre.2022.2333openalex-extracted
Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models
inferredcites →https://doi.org/10.1287/opre.2022.2391openalex-extracted
The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications
inferredcites →https://doi.org/10.1287/opre.49.3.334.11210openalex-extracted
Stocking Retail Assortments Under Dynamic Consumer Substitution
inferredcites →https://doi.org/10.2139/ssrn.3832909openalex-extracted
Joint Assortment and Inventory Planning for Heavy Tailed Demand
inferredcites →https://doi.org/10.2139/ssrn.4033922openalex-extracted
Revenue Management with Product Retirement and Customer Selection
inferredcites →https://doi.org/10.2139/ssrn.4454399openalex-extracted
On the Performance of Myopic and Stationary Revenue-Ordered Policies for Assortment Optimization with Popularity Effects
inferredcites →https://doi.org/10.2139/ssrn.4468430openalex-extracted
Assortment and Inventory Planning under Dynamic (Stockout-based) Substitution in the Presence of Customer Returns: A Fluid Analysis
inferredcites →https://doi.org/10.2307/2282347openalex-extracted
Individual Choice Behavior A Theoretical Analysis.
inferredcites →https://doi.org/10.48550/arxiv.1703.02628openalex-extracted
Global optimization of Lipschitz functions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.