The following pages link to Patrick Jaillet (Q342501):
Displaying 24 items.
- Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework (Q4408698) (← links)
- Online scheduling with multi‐state machines (Q4638572) (← links)
- Online traveling salesman problems with rejection options (Q4642471) (← links)
- Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces (Q4697083) (← links)
- (Q4711792) (← links)
- Advances on Matroid Secretary Problems: Free Order Model and Laminar Case (Q4910821) (← links)
- Robust Adaptive Routing Under Uncertainty (Q4969320) (← links)
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios (Q4995062) (← links)
- Online Resource Allocation Under Partially Predictable Demand (Q5003724) (← links)
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
- Strategic Workforce Planning Under Uncertainty (Q5080661) (← links)
- On Matching and Thickness in Heterogeneous Dynamic Markets (Q5129171) (← links)
- Online Stochastic Matching: New Algorithms with Better Bounds (Q5244859) (← links)
- Sampling Based Approaches for Minimizing Regret in Uncertain Markov Decision Processes (MDPs) (Q5278046) (← links)
- On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach (Q5363108) (← links)
- (Q5687194) (← links)
- A Priori Optimization (Q5753749) (← links)
- Logistics in Real Time Inventory Routing Operations under Stochastic Demand (Q5850932) (← links)
- Difference graphs (Q5895304) (← links)
- Universal regression with adversarial responses (Q6136596) (← links)
- Edge-Weighted Online Windowed Matching (Q6199281) (← links)
- An Improved Lower Bound for the Traveling Salesman Constant (Q6321528) (← links)
- When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation (Q6521702) (← links)
- Probabilistic bounds on the \(k\)-traveling salesman problem and the traveling repairman problem (Q6563030) (← links)
