An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem

DOI10.1007/978-3-319-96151-4_21zbMath1404.90115OpenAlexW2883777183MaRDI QIDQ1661892

Hipólito Hernández-Pérez, Juan-José Salazar-González

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_21

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

This page was built for publication: An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem