A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand

N Bianchessi, S Irnich, C Tilk - Discrete Applied Mathematics, 2021 - Elsevier
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …

[PDF][PDF] A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

N Bianchessi, S Irnicha, C Tilka - researchgate.net
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …

[PDF][PDF] A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

N Bianchessi, S Irnicha, C Tilka - logistik.bwl.uni-mainz.de
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …

A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

N Bianchessi, S Irnich, C Tilk - 2020 - econpapers.repec.org
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …

[PDF][PDF] A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

N Bianchessi, S Irnich, C Tilk - 2020 - download.uni-mainz.de
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …

A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

N Bianchessi, S Irnich, C Tilk - 2020 - ideas.repec.org
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …

[PDF][PDF] A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

N Bianchessi, S Irnich, C Tilk - 2020 - ipp-mainz.uni-mainz.de
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …

A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

N Bianchessi, S Irnich, C Tilk - DISCRETE APPLIED MATHEMATICS, 2021 - air.unimi.it
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …

[PDF][PDF] A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

N Bianchessia, S Irnicha, C Tilka - air.unimi.it
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously
selecting suppliers and routing a fleet of homogeneous vehicles to purchase different …