← Back
Home › Systems › Payments and commerce

retail-merchandising

Payments and commerce | retail-merchandising — merchandise planning and execution: assortment planning by store cluster, space and planogram optimisation, allocation, markdown optimisation, item and price master

Oracle Retail, Blue Yonder, RELEX

SystemTechniques · 24Primitives · 75 retail-merchandising DAG workflow executiondistributed · medium: Run a graph of dependent tasks by releasing each one when its inputs are done, longest chain first, and skip any task whose input hashes are unchanged.›Markdown price optimizationeconomics · medium: Choose markdown timing and depth over a season by dynamic programming with price-elasticity demand and inventoryMin cost flowgraphs · medium: Minimum-cost flow (successive shortest paths, network simplex) for distribution and rebalancingGradient-boosted decision trees (GB…machine-learning · medium: Add small regression trees one at a time, each fitted to the loss gradient; histogram splits over 256 bins make it the strongest tabular default.›Inventory policies safety stockoptimization · medium: (s,S), base-stock, EOQ and newsvendor policies with safety stock from demand uncertaintySimulated annealingoptimization · medium: Stochastic local search with a cooling schedule for combinatorial optimizationDeep forecasting modelsstatistics · medium: Neural forecasters (DeepAR, N-BEATS, TFT, patch transformers) with probabilistic outputs across many seriesQuantile regressionmachine-learning · low: Predicting quantiles with the pinball loss for probabilistic forecasts and prediction intervalsLinear and logistic regressionmachine-learning · low: Fit a weighted sum of features to a number (least squares) or a probability (logistic); the baseline every model must beat.›Largest remainder roundingfinance · low: Splitting an amount into parts that sum exactly (largest remainder / Hamilton) for allocations, splits and prorationsk-means clusteringmachine-learning · low: Partition points into k clusters by alternating nearest-centroid assignment and centroid averaging; k-means++ seeding makes it dependable.›Simplex methodoptimization · low: Solves linear programs by walking along the edges of the feasible polytope from vertex to vertex, one basis swap (pivot) at a time; the workhorse behind MIP solvers.›Rectangle bin packingoptimization · low: Skyline, guillotine and MaxRects packing for texture and glyph atlasesChoice model estimationstatistics · low: Multinomial-logit and nested choice models fit by maximum likelihood to estimate substitution and demand transferTopological sortgraphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.›Content-addressed storagestorage · low: Store each blob under the hash of its bytes: immutable, deduplicated by construction, self-verifying on every read, and composable into Merkle trees.›Exponential backoff with jittersystems · low: Retry after delays that grow geometrically and are randomized, so failed clients spread out instead of hammering a recovering service in synchronized waves.›d-ary heapdata-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.›Bellman ford negative cyclesgraphs · low: Bellman-Ford shortest paths with negative edges and negative-cycle (arbitrage) detectionDijkstra's algorithmgraphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.›Quantile sketchesdata-structures · low: Mergeable quantile sketches: t-digest, DDSketch, HDR histogramsLoss functionsmachine-learning · low: The scalar a model minimizes: cross-entropy for classes and tokens, MSE or Huber for values, each with a stable form and simple gradient.›Regularizationmachine-learning · low: Techniques that trade training fit for generalization: weight decay, dropout, early stopping, label smoothing and data mixing, with the exact update rules and defaults.›+ 17 more techniques+ 59 more primitives

Similar systems

Share the most building blocks with this one.