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

DOI10.1007/978-3-319-96151-4_21zbMATH Open1404.90115OpenAlexW2883777183MaRDI QIDQ1661892FDOQ1661892

Authors: 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

Recommendations

• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• scientific article; zbMATH DE number 1953194
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm

Mathematics Subject Classification ID

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

Cited In (1)

• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661892)