Luca Bertazzi

Optim. Lett., April, 2024

2023

The inventory routing problem with split deliveries.

[BibT_eX]

[DOI]

Nho Minh Dinh

Networks, December, 2023

2022

Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem.

[BibT_eX]

[DOI]

Xingyin Wang

Networks, 2022

A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment.

[BibT_eX]

[DOI]

Rossana Cavagnini

Eur. J. Oper. Res., 2022

Analysis of effective sets of routes for the split-delivery periodic inventory routing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

2021

Direct k-routing versus cross-docking: worst-case results.

[BibT_eX]

[DOI]

Jeffrey W. Ohlmann

Optim. Lett., 2021

Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery.

[BibT_eX]

[DOI]

Networks, 2021

Optimizing the distribution planning process in supply chains with distribution strategy choice.

[BibT_eX]

[DOI]

Andrea Bacchetti

Massimo Zanardini

J. Oper. Res. Soc., 2021

2020

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

[BibT_eX]

[DOI]

Nicola Secomandi

Oper. Res., 2020

An exact approach for cyclic inbound inventory routing in a level production system.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

2019

Stochastic optimization models for a bike-sharing problem with transshipment.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

The Bin Packing Problem with Item Fragmentation: A worst-case analysis.

[BibT_eX]

[DOI]

Bruce L. Golden

Xingyin Wang

Discret. Appl. Math., 2019

The value of the right distribution in stochastic programming with application to a Newsvendor problem.

[BibT_eX]

[DOI]

Matteo Cagnolari

Comput. Manag. Sci., 2019

2018

Faster rollout search for the vehicle routing problem with stochastic demands and restocking.

[BibT_eX]

[DOI]

Nicola Secomandi

Eur. J. Oper. Res., 2018

A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Dynamic expediting of an urgent order with uncertain progress.

[BibT_eX]

[DOI]

Riccardo Mogre

Eur. J. Oper. Res., 2018

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

The Undirected Capacitated General Routing Problem with Profits.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

2015

Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

Min-Max vs. Min-Sum Vehicle Routing: A worst-case analysis.

[BibT_eX]

[DOI]

Bruce L. Golden

Xingyin Wang

Eur. J. Oper. Res., 2015

2014

Analysis of the Best Double Frequency Policy in the Single Link Problem with Discrete Shipping Times.

[BibT_eX]

[DOI]

Lap Mui Ann Chan

J. Optim. Theory Appl., 2014

Polynomial cases of the economic lot sizing problem with cost discounts.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Determining Transportation Mode Choice To Minimize Distribution Cost: Direct Shipping, Transit Point And 2-Routing.

[BibT_eX]

[DOI]

Jeffrey W. Ohlmann

Proceedings of the 28th European Conference on Modelling and Simulation, 2014

2013

Inventory routing problems with multiple customers.

[BibT_eX]

[DOI]

M. Grazia Speranza

EURO J. Transp. Logist., 2013

An inventory-transportation system with stochastic demand.

[BibT_eX]

[DOI]

Simona S. M. Cherubini

Comput. Manag. Sci., 2013

2012

Minimum and Worst-Case Performance Ratios of Rollout Algorithms.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2012

Integrating transportation and production: an international study case.

[BibT_eX]

[DOI]

O. Zappa

J. Oper. Res. Soc., 2012

A Hybrid Heuristic for an Inventory Routing Problem.

[BibT_eX]

[DOI]

Alain Hertz

INFORMS J. Comput., 2012

Inventory routing problems: an introduction.

[BibT_eX]

[DOI]

M. Grazia Speranza

EURO J. Transp. Logist., 2012

2011

Analysis of the maximum level policy in a production-distribution system.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

2010

Reoptimizing the 0-1 knapsack problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

Stochastic optimization models for a single-sink transportation problem.

[BibT_eX]

[DOI]

Michal Kaut

Comput. Manag. Sci., 2009

2008

Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times.

[BibT_eX]

[DOI]

Manag. Sci., 2008

2007

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.

[BibT_eX]

[DOI]

Gilbert Laporte

Transp. Sci., 2007

2005

Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System.

[BibT_eX]

[DOI]

J. Heuristics, 2005

Improved rounding procedures for the discrete version of the capacitated EOQ problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

2004

An improved heuristic for the period traveling salesman problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2004

2003

Reoptimizing the traveling salesman problem.

[BibT_eX]

[DOI]

Networks, 2003

2002

Continuous and Discrete Shipping Strategies for the Single Link Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2002

Deterministic Order-Up-To Level Policies in an Inventory Routing Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2002

2001

Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem.

[BibT_eX]

[DOI]