The following pages link to Alejandro Toriello (Q433827):
Displayed 25 items.
- The value function of an infinite-horizon single-item lot-sizing problem (Q433828) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Dynamic linear programming games with risk-averse players (Q526824) (← links)
- The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
- Integrated inventory routing and freight consolidation for perishable goods (Q724138) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- Dynamic cost allocation for economic lot sizing games (Q1667179) (← links)
- Modeling stochastic dominance as infinite-dimensional constraint systems via the Strassen theorem (Q1730821) (← links)
- On packing and covering polyhedra in infinite dimensions (Q1785750) (← links)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- Dynamic node packing (Q2097666) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
- A Dynamic Traveling Salesman Problem with Stochastic Arc Costs (Q2942707) (← links)
- Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
- A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency (Q5106381) (← links)
- Dynamic Relaxations for Online Bipartite Matching (Q5106387) (← links)
- Technical Note—On Traveling Salesman Games with Asymmetric Costs (Q5166292) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs (Q6072162) (← links)
- Robust planning of sorting operations in express delivery systems (Q6106487) (← links)