Part 3: Allocation Algorithms — Greedy vs. Mixed-Integer Linear Programming
← Previous Chapter: Part 2: Real-Time Inventory | Series Hub | Next Chapter: Part 4: Anticipatory Shipping → Answer-first: Greedy algorithms run in $O(N)$ (<2ms) and work well for simple carts. For complex multi-item baskets across 20+ fulfillment centers, MILP solvers achieve 12–18% lower total shipping costs within a 35ms compute budget.