Luca Bertazzi

According to our database1, Luca Bertazzi authored at least 33 papers between 2001 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Technical Note - Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands.
Oper. Res., 2020

An exact approach for cyclic inbound inventory routing in a level production system.
Eur. J. Oper. Res., 2020

2019
Stochastic optimization models for a bike-sharing problem with transshipment.
Eur. J. Oper. Res., 2019

The Bin Packing Problem with Item Fragmentation: A worst-case analysis.
Discret. Appl. Math., 2019

The value of the right distribution in stochastic programming with application to a Newsvendor problem.
Comput. Manag. Sci., 2019

2018
Faster rollout search for the vehicle routing problem with stochastic demands and restocking.
Eur. J. Oper. Res., 2018

A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach.
Eur. J. Oper. Res., 2018

Dynamic expediting of an urgent order with uncertain progress.
Eur. J. Oper. Res., 2018

Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014.
Discret. Appl. Math., 2018

2017
The Undirected Capacitated General Routing Problem with Profits.
Eur. J. Oper. Res., 2017

2015
Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse.
J. Optim. Theory Appl., 2015

Min-Max vs. Min-Sum Vehicle Routing: A worst-case analysis.
Eur. J. Oper. Res., 2015

2014
Analysis of the Best Double Frequency Policy in the Single Link Problem with Discrete Shipping Times.
J. Optim. Theory Appl., 2014

Polynomial cases of the economic lot sizing problem with cost discounts.
Eur. J. Oper. Res., 2014

Determining Transportation Mode Choice To Minimize Distribution Cost: Direct Shipping, Transit Point And 2-Routing.
Proceedings of the 28th European Conference on Modelling and Simulation, 2014

2013
Inventory routing problems with multiple customers.
EURO J. Transportation and Logistics, 2013

An inventory-transportation system with stochastic demand.
Comput. Manag. Sci., 2013

2012
Minimum and Worst-Case Performance Ratios of Rollout Algorithms.
J. Optim. Theory Appl., 2012

Integrating transportation and production: an international study case.
J. Oper. Res. Soc., 2012

A Hybrid Heuristic for an Inventory Routing Problem.
INFORMS J. Comput., 2012

Inventory routing problems: an introduction.
EURO J. Transportation and Logistics, 2012

2011
Analysis of the maximum level policy in a production-distribution system.
Comput. Oper. Res., 2011

2010
Reoptimizing the 0-1 knapsack problem.
Discret. Appl. Math., 2010

2009
Stochastic optimization models for a single-sink transportation problem.
Comput. Manag. Sci., 2009

2008
Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times.
Manag. Sci., 2008

2007
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.
Transportation Science, 2007

2005
Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System.
J. Heuristics, 2005

Improved rounding procedures for the discrete version of the capacitated EOQ problem.
Eur. J. Oper. Res., 2005

2004
An improved heuristic for the period traveling salesman problem.
Comput. Oper. Res., 2004

2003
Reoptimizing the traveling salesman problem.
Networks, 2003

2002
Continuous and Discrete Shipping Strategies for the Single Link Problem.
Transportation Science, 2002

Deterministic Order-Up-To Level Policies in an Inventory Routing Problem.
Transportation Science, 2002

2001
Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem.
Annals OR, 2001


  Loading...