On the public citation graph
The Discrete Two-Dimensional Assortment Problem
0 signed · 69 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-94-017-6403-2openalex-snapshot
Standardization: Mathematical Methods in Assortment Determination
inferredcites →https://doi.org/10.1057/jors.1975.66openalex-snapshot
A Note on a Two-dimensional Dynamic Programming Problem
inferredcites →https://doi.org/10.1057/jors.1976.187openalex-snapshot
The Cutting Stock Problem in the Flat Glass Industry -- Selection of Stock Sizes
inferredcites →https://doi.org/10.1111/j.1540-5915.1984.tb01214.xopenalex-snapshot
OPTIMAL DIMENSIONS OF VIRGIN STOCK IN CUTTING GLASS TO ORDER
inferredcites →https://doi.org/10.1287/mnsc.1040.0262openalex-snapshot
Dynamic Version of the Economic Lot Size Model
inferredcites →https://doi.org/10.1287/mnsc.14.7.429openalex-snapshot
Minimum Concave Cost Flows in Certain Networks
inferredcites →https://doi.org/10.1287/mnsc.21.3.286openalex-snapshot
The Assortment Problem with Probabilistic Demands
inferredcites →https://doi.org/10.1287/mnsc.6.1.13openalex-snapshot
A Few Remarks on the Assortment Problem
inferredcites →https://doi.org/10.1287/opre.13.4.570openalex-snapshot
Selecting the Best Lengths to Stock
inferredcites →https://doi.org/10.1287/opre.24.6.1129openalex-snapshot
The Assortment Problem with Nonlinear Cost Functions
inferredcites →https://doi.org/10.1287/opre.26.6.992openalex-snapshot
A Dual-Based Procedure for Uncapacitated Facility Location
inferredcites →https://doi.org/10.1287/opre.33.3.678openalex-snapshot
Technical Note—On the Optimal Choice of Sizes
inferredcites →https://doi.org/10.6028/nbs.ir.78-1539openalex-snapshot
Mathematical models for selecting catalogs of standard-sized items
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199905)33:3<239::aid-net10>3.0.co;2-gopenalex-snapshot
Multidimensional assortment problem with an application
inferred← citeshttps://doi.org/10.1002/nav.10090openalex-snapshot
Optimal retail assortments for substitutable items purchased in sets
inferred← citeshttps://doi.org/10.1007/3-540-44688-5_9openalex-snapshot
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem
inferred← citeshttps://doi.org/10.1007/3-540-45034-3_5openalex-snapshot
A Genetic Algorithm for 1,5 Dimensional Assortment Problems with Multiple Objectives
inferred← citeshttps://doi.org/10.1007/978-0-387-78902-6_7openalex-snapshot
Managing Variety on the Retail Shelf: Using Household Scanner Panel Data to Rationalize Assortments
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_2openalex-snapshot
Maximization of Submodular Functions: Theory and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_3openalex-snapshot
Data Correcting Approach for the Maximization of Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_4openalex-snapshot
Data Correcting Approach for the Simple Plant Location Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-4949-9_17openalex-snapshot
Retail Inventories and Consumer Choice
inferred← citeshttps://doi.org/10.1007/978-1-4899-7562-1_10openalex-snapshot
Managing Variety on the Retail Shelf: Using Household Scanner Panel Data to Rationalize Assortments
inferred← citeshttps://doi.org/10.1007/s00291-008-0148-1openalex-snapshot
Efficient reformulations for dynamic lot-sizing problems with product substitution
inferred← citeshttps://doi.org/10.1016/0895-7177(92)90080-5openalex-snapshot
Solution to the assortment problem via the genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.10.081openalex-snapshot
Equivalent instances of the simple plant location problem
inferred← citeshttps://doi.org/10.1016/j.cie.2007.08.009openalex-snapshot
An approach to product variety management in the painted sheet metal industry
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.07.008openalex-snapshot
The assortment problem: A survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.08.004openalex-snapshot
Optimizing product assortment under customer-driven demand substitution
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.04.013openalex-snapshot
A classification of the literature on the planning of substitutable products
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.04.036openalex-snapshot
A co-opetitive newsvendor model with product substitution and a wholesale price contract
inferred← citeshttps://doi.org/10.1016/j.omega.2020.102372openalex-snapshot
Optimal use of downward substitution in a manufacturing operation subject to uncertainty
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00049-7openalex-snapshot
Branch and peg algorithms for the simple plant location problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00190-9openalex-snapshot
Branch and peg algorithms for the simple plant location problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00201-1openalex-snapshot
Stock selection heuristics for interdependent items
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00504-0openalex-snapshot
Neighborhood search heuristics for the uncapacitated facility location problem
inferred← citeshttps://doi.org/10.1023/a:1022503826877openalex-snapshot
Solving the Simple Plant Location Problem using a Data Correcting Approach
inferred← citeshttps://doi.org/10.1057/jors.1992.101openalex-snapshot
Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
inferred← citeshttps://doi.org/10.1057/jors.1994.41openalex-snapshot
A Practical Approach for Determining Rectangular Stock Sizes
inferred← citeshttps://doi.org/10.1057/jors.1996.33openalex-snapshot
Using a Facility Location Algorithm to Determine Optimum Cast Bloom Lengths
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601469openalex-snapshot
A large-scale application of the partial coverage uncapacitated facility location problem
inferred← citeshttps://doi.org/10.1080/00207540500459678openalex-snapshot
Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach
inferred← citeshttps://doi.org/10.1080/00207543.2020.1720923openalex-snapshot
The cutting stock problem with multiple manufacturing modes applied to a construction industry
inferred← citeshttps://doi.org/10.1080/00207549108948100openalex-snapshot
A comparison of solution methods for the assortment problem
inferred← citeshttps://doi.org/10.1080/07408170490247304openalex-snapshot
Multi-product inventory planning with downward substitution, stochastic demand and setup costs
inferred← citeshttps://doi.org/10.1080/07408170490500663openalex-snapshot
Strategic inventory deployment in the steel industry
inferred← citeshttps://doi.org/10.1080/09537289508930249openalex-snapshot
Co-production of substitutable products
inferred← citeshttps://doi.org/10.1080/23270012.2021.1881922openalex-snapshot
Optimal inventory policies for short life cycle successive generations’ technology products
inferred← citeshttps://doi.org/10.1109/ccis.2012.6664384openalex-snapshot
Demand forecasting method based on adjacent substitution rate estimation by GA
inferred← citeshttps://doi.org/10.1109/fskd.2016.7603277openalex-snapshot
Estimation of adjacent substitution rate based on clustering algorithm and its application
inferred← citeshttps://doi.org/10.1111/j.1937-5956.2003.tb00199.xopenalex-snapshot
MANAGING PRODUCT VARIETY: AN INTEGRATIVE REVIEW AND RESEARCH DIRECTIONS
inferred← citeshttps://doi.org/10.1111/j.1937-5956.2012.01389.xopenalex-snapshot
Sequence Matters: Shelf‐Space Allocation under Dynamic Customer‐Driven Substitution
inferred← citeshttps://doi.org/10.1126/science.267.5198.664openalex-snapshot
Taboo Search: An Approach to the Multiple Minima Problem
inferred← citeshttps://doi.org/10.1243/095440504322984867openalex-snapshot
Use of genetic algorithms in operations management: Part 1: Applications
inferred← citeshttps://doi.org/10.1287/ijoc.1060.0196openalex-snapshot
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
inferred← citeshttps://doi.org/10.1287/ijoc.8.3.260openalex-snapshot
Selecting Ingot Sizes for Joint Production of Sheet Products
inferred← citeshttps://doi.org/10.1287/opre.1090.0805openalex-snapshot
Assortment Planning and Inventory Decisions Under Stockout-Based Substitution
inferred← citeshttps://doi.org/10.1287/opre.44.1.7openalex-snapshot
Process Planning for Aluminum Tubes: An Engineering-Operations Perspective
inferred← citeshttps://doi.org/10.1287/opre.48.1.50.12443openalex-snapshot
Management of Multi-Item Retail Inventory Systems with Demand Substitution
inferred← citeshttps://doi.org/10.1504/ijir.2008.019206openalex-snapshot
The assortment problem with dynamic deterministic demands and stationary stocking-substitution policies
inferred← citeshttps://doi.org/10.31387/oscm0460301openalex-snapshot
The First Half-Century of Decision Modelling for Substitutable Products: A Literature Review and Bibliographic Analysis
inferred← citeshttps://doi.org/10.31796/ogummf.519900openalex-snapshot
BİR OLUKLU MUKAVVA KUTU FABRİKASINDA STANDART BOBİN ENLERİNİN BELİRLENMESİ
inferred← citeshttps://doi.org/10.4018/978-1-61350-504-5.ch016openalex-snapshot
Quantitative Models in Supply Chain Management
inferred← citeshttps://doi.org/10.58837/chula.the.2016.137openalex-snapshot
ปรมาณการสงซอทเหมาะสมของสนคาททดแทนกนได
inferred← citeshttps://doi.org/10.58837/chula.the.2019.655openalex-snapshot
การวางแผนพสดคงคลงททดแทดกนได
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.