| Publication | Date of Publication | Type |
|---|
The I.I.D. prophet inequality with limited flexibility (edit)
Mathematics of Operations Research | 2026-03-20 | Paper |
Robust online selection with uncertain offer acceptance
Mathematics of Operations Research | 2025-09-30 | Paper |
Distributionally robust disaster relief planning under the Wasserstein set
Computers & Operations Research | 2025-05-26 | Paper |
On linear threshold policies for continuous-time dynamic yield management
Operations Research Letters | 2025-05-05 | Paper |
Continuity of care in home health care scheduling: a rolling horizon approach
Journal of Scheduling | 2024-10-16 | Paper |
<scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs
Naval Research Logistics | 2023-10-12 | Paper |
Robust planning of sorting operations in express delivery systems
European Journal of Operational Research | 2023-07-03 | Paper |
Adaptive Bin Packing with Overflow
Mathematics of Operations Research | 2023-01-09 | Paper |
Interval scheduling with economies of scale
Computers & Operations Research | 2022-12-19 | Paper |
Dynamic node packing
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
Dynamic resource allocation in the cloud with near-optimal efficiency
Operations Research | 2022-09-19 | Paper |
Dynamic Relaxations for Online Bipartite Matching
INFORMS Journal on Computing | 2022-09-19 | Paper |
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
Mathematical Programming Computation | 2021-11-16 | Paper |
Modeling stochastic dominance as infinite-dimensional constraint systems via the Strassen theorem
Journal of Optimization Theory and Applications | 2019-03-06 | Paper |
Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
SIAM Journal on Optimization | 2019-01-14 | Paper |
A polyhedral approach to online bipartite matching
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
On packing and covering polyhedra in infinite dimensions
Operations Research Letters | 2018-10-01 | Paper |
Dynamic cost allocation for economic lot sizing games
Operations Research Letters | 2018-08-27 | Paper |
The dynamic dispatch waves problem for same-day delivery
European Journal of Operational Research | 2018-07-25 | Paper |
Integrated inventory routing and freight consolidation for perishable goods
European Journal of Operational Research | 2018-07-25 | Paper |
Dynamic linear programming games with risk-averse players
Mathematical Programming. Series A. Series B | 2017-05-15 | Paper |
Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
SIAM Journal on Optimization | 2016-09-02 | Paper |
A Polyhedral Approach to Online Bipartite Matching
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
A dynamic traveling salesman problem with stochastic arc costs
Operations Research | 2015-09-11 | Paper |
Technical Note—On Traveling Salesman Games with Asymmetric Costs
Operations Research | 2014-06-26 | Paper |
Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
Mathematical Programming. Series A. Series B | 2014-06-02 | Paper |
Fitting piecewise linear continuous functions
European Journal of Operational Research | 2012-08-16 | Paper |
The value function of an infinite-horizon single-item lot-sizing problem
Operations Research Letters | 2012-07-06 | Paper |
Decomposing inventory routing problems with approximate value functions
Naval Research Logistics | 2011-01-06 | Paper |
Approximating the stability region for binary mixed-integer programs
Operations Research Letters | 2009-08-14 | Paper |
On Linear Threshold Policies for Continuous-Time Dynamic Yield Management
(available as arXiv preprint) | N/A | Paper |
