Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Potential-Based Greedy Matching for Dynamic Delivery Pooling
Hongyao Ma, Will Ma, Matias Romero
We study the dynamic pooling of multiple orders into a single trip, a strategy widely adopted by online delivery platforms. When an order has to be dispatched, the platform must de…
cs.DS2025
Optimizing Inventory Placement for a Downstream Online Matching Problem
Boris Epstein, Will Ma
We study the inventory placement problem of splitting units of a single item across warehouses in advance of a downstream online matching problem that represents the dynamic fu…
cs.DS2024
Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
Will Ma
Randomized rounding is a technique that was originally used to approximate hard offline discrete optimization problems from a mathematical programming relaxation. Since then it has…