Luca Bertazzi

48 papers C 1Journal 47
YearRankTypeTitle / Venue / Authors
2026 J jnl
Accurately estimating optimal SDVRP solution values using regression models.
Comput. Oper. Res.
Shuhan Kou, Bruce L. Golden, Luca Bertazzi
2026 J jnl
Some worst-case results related to the asymmetric traveling salesman problem.
Optim. Lett.
Luca Bertazzi, Bruce L. Golden, Shuhan Kou
2025 J jnl
Matheuristic Algorithms for the Inventory Routing Problem With Unsplit and Split Deliveries.
Networks
Nho Minh Dinh, Claudia Archetti, Luca Bertazzi
2024 J jnl
A two-stage stochastic programming model for bike-sharing systems with rebalancing.
EURO J. Transp. Logist.
Rossana Cavagnini, Francesca Maggioni, Luca Bertazzi, Mike Hewitt
2024 J jnl
An improved model for estimating optimal VRP solution values.
Optim. Lett.
Shuhan Kou, Bruce L. Golden, Luca Bertazzi
2024 J jnl
Competitive Analysis of Algorithms for an Online Distribution Problem.
Algorithms
Alessandro Barba, Luca Bertazzi, Bruce L. Golden
2024 J jnl
Dynamic Project Expediting: A Stochastic Shortest-Path Approach.
Manag. Sci.
Luca Bertazzi, Riccardo Mogre, Nikolaos Trichakis
2024 J jnl
Estimating optimal split delivery vehicle routing problem solution values.
Comput. Oper. Res.
Shuhan Kou, Bruce L. Golden, Luca Bertazzi
2023 J jnl
The inventory routing problem with split deliveries.
Networks
Nho Minh Dinh, Claudia Archetti, Luca Bertazzi
2022 J jnl
A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment.
Eur. J. Oper. Res.
Rossana Cavagnini, Luca Bertazzi, Francesca Maggioni
2022 J jnl
Analysis of effective sets of routes for the split-delivery periodic inventory routing problem.
Eur. J. Oper. Res.
Luca Bertazzi, Geoffrey A. Chua, Demetrio Laganà, Rosario Paradiso
2022 J jnl
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem.
Networks
Luca Bertazzi, Xingyin Wang
2021 J jnl
Direct k-routing versus cross-docking: worst-case results.
Optim. Lett.
Luca Bertazzi, Jeffrey W. Ohlmann
2021 J jnl
Optimizing the distribution planning process in supply chains with distribution strategy choice.
J. Oper. Res. Soc.
Andrea Bacchetti, Luca Bertazzi, Massimo Zanardini
2021 J jnl
Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery.
Networks
Claudia Archetti, Luca Bertazzi
2020 J jnl
An exact approach for cyclic inbound inventory routing in a level production system.
Eur. J. Oper. Res.
Luca Bertazzi, Demetrio Laganà, Jeffrey W. Ohlmann, Rosario Paradiso
2020 J jnl
Technical Note - Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands.
Oper. Res.
Luca Bertazzi, Nicola Secomandi
2019 J jnl
Stochastic optimization models for a bike-sharing problem with transshipment.
Eur. J. Oper. Res.
Francesca Maggioni, Matteo Cagnolari, Luca Bertazzi, Stein W. Wallace
2019 J jnl
The Bin Packing Problem with Item Fragmentation: A worst-case analysis.
Discret. Appl. Math.
Luca Bertazzi, Bruce L. Golden, Xingyin Wang
2019 J jnl
The value of the right distribution in stochastic programming with application to a Newsvendor problem.
Comput. Manag. Sci.
Francesca Maggioni, Matteo Cagnolari, Luca Bertazzi
2018 J jnl
A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach.
Eur. J. Oper. Res.
Luca Bertazzi, Francesca Maggioni
2018 J jnl
Dynamic expediting of an urgent order with uncertain progress.
Eur. J. Oper. Res.
Luca Bertazzi, Riccardo Mogre
2018 J jnl
Faster rollout search for the vehicle routing problem with stochastic demands and restocking.
Eur. J. Oper. Res.
Luca Bertazzi, Nicola Secomandi
2018 J jnl
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014.
Discret. Appl. Math.
Claudia Archetti, Luca Bertazzi, Martin Milanic, David Schindl, Sacha Varone
2017 J jnl
The Undirected Capacitated General Routing Problem with Profits.
Eur. J. Oper. Res.
Claudia Archetti, Luca Bertazzi, Demetrio Laganà, Francesca Vocaturo
2015 J jnl
Min-Max vs. Min-Sum Vehicle Routing: A worst-case analysis.
Eur. J. Oper. Res.
Luca Bertazzi, Bruce L. Golden, Xingyin Wang
2015 J jnl
Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse.
J. Optim. Theory Appl.
Luca Bertazzi, Francesca Maggioni
2014 J jnl
Analysis of the Best Double Frequency Policy in the Single Link Problem with Discrete Shipping Times.
J. Optim. Theory Appl.
Luca Bertazzi, Lap Mui Ann Chan
2014 C conf
Determining Transportation Mode Choice To Minimize Distribution Cost: Direct Shipping, Transit Point And 2-Routing.
ECMS
Luca Bertazzi, Jeffrey W. Ohlmann
2014 J jnl
Polynomial cases of the economic lot sizing problem with cost discounts.
Eur. J. Oper. Res.
Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
2013 J jnl
An inventory-transportation system with stochastic demand.
Comput. Manag. Sci.
Luca Bertazzi, Simona S. M. Cherubini
2013 J jnl
Inventory routing problems with multiple customers.
EURO J. Transp. Logist.
Luca Bertazzi, M. Grazia Speranza
2012 J jnl
A Hybrid Heuristic for an Inventory Routing Problem.
INFORMS J. Comput.
Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza
2012 J jnl
Integrating transportation and production: an international study case.
J. Oper. Res. Soc.
Luca Bertazzi, O. Zappa
2012 J jnl
Inventory routing problems: an introduction.
EURO J. Transp. Logist.
Luca Bertazzi, M. Grazia Speranza
2012 J jnl
Minimum and Worst-Case Performance Ratios of Rollout Algorithms.
J. Optim. Theory Appl.
Luca Bertazzi
2011 J jnl
Analysis of the maximum level policy in a production-distribution system.
Comput. Oper. Res.
Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
2010 J jnl
Reoptimizing the 0-1 knapsack problem.
Discret. Appl. Math.
Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
2009 J jnl
Stochastic optimization models for a single-sink transportation problem.
Comput. Manag. Sci.
Francesca Maggioni, Michal Kaut, Luca Bertazzi
2008 J jnl
Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times.
Manag. Sci.
Luca Bertazzi
2007 J jnl
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.
Transp. Sci.
Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza
2005 J jnl
Improved rounding procedures for the discrete version of the capacitated EOQ problem.
Eur. J. Oper. Res.
Luca Bertazzi, Maria Grazia Speranza
2005 J jnl
Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System.
J. Heuristics
Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
2004 J jnl
An improved heuristic for the period traveling salesman problem.
Comput. Oper. Res.
Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
2003 J jnl
Reoptimizing the traveling salesman problem.
Networks
Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
2002 J jnl
Continuous and Discrete Shipping Strategies for the Single Link Problem.
Transp. Sci.
Luca Bertazzi, Maria Grazia Speranza
2002 J jnl
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem.
Transp. Sci.
Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
2001 J jnl
Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem.
Ann. Oper. Res.
Luca Bertazzi, Maria Grazia Speranza