Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries

DOI10.1287/opre.2017.1639zbMath1382.90006OpenAlexW2752778863MaRDI QIDQ4602474

Manuel Iori, Bruno P. Bruck

Publication date: 11 January 2018

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11380/1141642

zbMATH Keywords

valid inequalitiesbranch-and-cutpickup and deliveryselective pickupsone-to-many-to-one

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (6)

The double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ Analysis of the selective traveling salesman problem with time-dependent profits ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints ⋮ Logic-based Benders decomposition algorithm for contamination detection problem in water networks ⋮ A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows

This page was built for publication: Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries