Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem
From MaRDI portal
Publication:4995102
DOI10.1287/ijoc.2020.0990zbMath1466.90008OpenAlexW3092923489MaRDI QIDQ4995102
Alexander S. Estes, Michael O. Ball
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.0990
stochastic optimizationgreedy algorithmtransportation problemmulti-period optimizationMonge properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- Monge and feasibility sequences in general flow problems
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- Dynamic pickup and delivery problems
- An algorithm for the detection and construction of Monge sequences
- Implementation in the many-to-many matching market.
- A framework for the greedy algorithm
- Perspectives of Monge properties in optimization
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Optimization for dynamic ride-sharing: a review
- Stability in dynamic matching markets
- Monge properties, discrete convexity and applications
- A dynamic school choice model
- Sparse Monge matrices arising from scheduling problems
- Credible group stability in many-to-many matching problems
- A General Class of Greedily Solvable Linear Programs
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
- Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem
- AdWords and generalized online matching
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- A Stochastic Integer Program with Dual Network Structure and Its Application to the Ground-Holding Problem
- On the Greedy Solution of Ordering Problems
- Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
- Dynamic Matching for Real-Time Ride Sharing
- Spatial Pricing in Ride-Sharing Networks
- Online matching with concave returns
- Online bipartite matching with random arrivals
- Matroids and the greedy algorithm
- College Admissions and the Stability of Marriage
