Gated Priority-based Greedy policies achieve competitive ratios for online multi-item order fulfillment in two-layer networks that match or nearly match lower bounds under time-varying and time-invariant costs.
Naval Research Logistics (NRL) 68(6):779--794, ISSN 0894-069X
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal and Order-optimal Gated Priority-based Greedy Policies for Two-layer Multi-item Order Fulfillment
Gated Priority-based Greedy policies achieve competitive ratios for online multi-item order fulfillment in two-layer networks that match or nearly match lower bounds under time-varying and time-invariant costs.