Writing · Tagged
#optimization
5 articles
Three Generations of a Warehouse Routing Engine
From a Node.js solver built on npm libraries to a 144 KB Rust/WASM binary with Jump Point Search, compile-time code generation, and a nearest-neighbor + 2-opt solver that closes within 1% of the ILP optimum.
Walking Is the Most Expensive Warehouse Operation
How one engineer built a custom route optimization system for a small Italian warehouse: the problem, the constraints, and why naive pick sequences waste half an operator's shift.
Stochastic Greedy: Scaling Submodular Maximization to Massive Datasets
Stochastic Greedy replaces greedy's full scan with random subsampling, reducing runtime from O(nk) to O(n log(1/ε)) while losing only an additive ε in the approximation guarantee. This post covers the algorithm, its proof, and practical guidance.
The Greedy Algorithm for Submodular Maximization
The greedy algorithm achieves a (1 - 1/e) approximation for monotone submodular maximization, provably the best any efficient algorithm can do. This post covers the algorithm, its proof, Lazy Greedy, and when greedy fails.
An Introduction to Submodularity
A practical introduction to submodular functions, the mathematical framework behind diminishing returns, covering set functions, marginal gains, and real-world applications from sensor placement to influence maximization.