A branch-and-cut algorithm for a skip pick-up and delivery problem

DOI10.1016/J.COR.2024.106705MaRDI QIDQ6979451zbMATH OpenFDO

Authors José-Manuel Belenguer, Maximiliano Cubillos, Sanne Wøhlk

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106705

zbMATH Keywords

branch-and-cutpick-up and delivery problemsskip transporttransportwaste

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• An asymmetric vehicle routing problem arising in the collection and disposal of special waste
• scientific article; zbMATH DE number 2130494 (Why is no real title available?)
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Optimal sequencing of skip collections and deliveries
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
• The Rollon-Rolloff vehicle routing problem
• The rollon-rolloff waste collection vehicle routing problem with time windows
• Transport of skips between recycling centers and treatment facilities

Cited in

(1)

• Fragment-based solution of two skip pickup and delivery problems

This page was built for publication: A branch-and-cut algorithm for a skip pick-up and delivery problem

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