Return to results
Journal articles (2020), European Journal of Operational Research, 282 (3), pp. 886-895

A Branch-And-Cut Algorithm for the Inventory Routing Problem with Pickups and Deliveries

ARCHETTI Claudia , GRAZIA SPERANZA M., BOCCIA M., SFORZA A., STERLE C.

This paper addresses the Inventory Routing Problem with Pickups and Deliveries (IRP-PD). A single commodity has to be picked up from several origins and distributed to several destinations. The commodity is made available at the supplier depot and at the

ARCHETTI, C., GRAZIA SPERANZA, M., BOCCIA, M., SFORZA, A. and STERLE, C. (2020). A Branch-And-Cut Algorithm for the Inventory Routing Problem with Pickups and Deliveries. European Journal of Operational Research, 282(3), pp. 886-895.