论文信息 - Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem

Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem

We consider a dynamic, stochastic extension to the transportation problem. For the deterministic problem, there are known necessary and sufficient conditions under which a greedy algorithm achieves...

Michael O. Ball | Alexander S. Estes

[1] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.

[2] A. Hoffman. ON SIMPLE LINEAR PROGRAMMING PROBLEMS , 2003 .

[3] Gilbert Laporte,et al. Recent Models and Algorithms for One-to-One Pickup and Delivery Problems , 2008 .

[4] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[5] E. Glen Weyl,et al. Surge Pricing Solves the Wild Goose Chase , 2017, EC.