Alejandro Toriello

Orcid: 0000-0002-3147-0764

According to our database1, Alejandro Toriello authored at least 39 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Temporal Bin Packing with Half-Capacity Jobs.
INFORMS J. Optim., January, 2024

2023
Branch-and-price for routing with probabilistic customers.
Comput. Ind. Eng., September, 2023

Robust planning of sorting operations in express delivery systems.
Eur. J. Oper. Res., 2023

Interval scheduling with economies of scale.
Comput. Oper. Res., 2023

2022
Adaptive Bin Packing with Overflow.
Math. Oper. Res., November, 2022

Acyclic Mechanism Design for Freight Consolidation.
Transp. Sci., 2022

Fleet Sizing and Service Region Partitioning for Same-Day Delivery Systems.
Transp. Sci., 2022

Dynamic node packing.
Math. Program., 2022

Tactical Design of Same-Day Delivery Systems.
Manag. Sci., 2022

Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency.
Oper. Res., 2022

Dynamic Relaxations for Online Bipartite Matching.
INFORMS J. Comput., 2022

The IID Prophet Inequality with Limited Flexibility.
CoRR, 2022

Multi Purpose Routing: New Perspectives and Approximation Algorithms.
CoRR, 2022

2021
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes.
Math. Program. Comput., 2021

Dynamic Inventory Allocation for Seasonal Merchandise at Dillard's.
INFORMS J. Appl. Anal., 2021

Two-stage sort planning for express parcel delivery.
IISE Trans., 2021

Robust Online Selection with Uncertain Offer Acceptance.
CoRR, 2021

The Traveling Firefighter Problem.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Online Adaptive Bin Packing with Overflow.
CoRR, 2020

2019
Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes.
SIAM J. Optim., 2019

2018
The One-Dimensional Dynamic Dispatch Waves Problem.
Transp. Sci., 2018

A polyhedral approach to online bipartite matching.
Math. Program., 2018

Modeling Stochastic Dominance as Infinite-Dimensional Constraint Systems via the Strassen Theorem.
J. Optim. Theory Appl., 2018

The Dynamic Dispatch Waves Problem for same-day delivery.
Eur. J. Oper. Res., 2018

Integrated inventory routing and freight consolidation for perishable goods.
Eur. J. Oper. Res., 2018

2017
Dynamic linear programming games with risk-averse players.
Math. Program., 2017

2016
Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes.
SIAM J. Optim., 2016

On packing and covering polyhedra in infinite dimensions.
Oper. Res. Lett., 2016

Optimized Financial Systems Helps Customers Meet Their Personal Finance Goals with Optimization.
Interfaces, 2016

2014
Dynamic cost allocation for economic lot sizing games.
Oper. Res. Lett., 2014

Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem.
Math. Program., 2014

A Dynamic Traveling Salesman Problem with Stochastic Arc Costs.
Oper. Res., 2014

2013
Technical Note - On Traveling Salesman Games with Asymmetric Costs.
Oper. Res., 2013

Evaluation of Transportation Practices in the California Cut Flower Industry.
Interfaces, 2013

2012
Fixed-Charge Transportation with Product Blending.
Transp. Sci., 2012

The value function of an infinite-horizon single-item lot-sizing problem.
Oper. Res. Lett., 2012

Fitting piecewise linear continuous functions.
Eur. J. Oper. Res., 2012

2010
Time decomposition of multi-period supply chain models.
PhD thesis, 2010

2009
Approximating the stability region for binary mixed-integer programs.
Oper. Res. Lett., 2009


  Loading...