A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
From MaRDI portal
Publication:6065616
DOI10.1016/j.cor.2023.106426OpenAlexW4386797604MaRDI QIDQ6065616
Jorge Riera-Ledesma, Bencomo Domínguez-Martín, Hipólito Hernández-Pérez, Inmaculada Rodríguez-Martín
Publication date: 15 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106426
Cites Work
- A survey of recent research on location-routing problems
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- A branch-and-cut algorithm for the hub location and routing problem
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Location-routing: issues, models and methods
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- A result on projection for the vehicle routing problem
- The travelling salesman problem with pick-up and delivery
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- A compact model and tight bounds for a combined location-routing problem
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- The single-vehicle two-echelon one-commodity pickup and delivery problem
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
- Bike sharing systems: solving the static rebalancing problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A review of vehicle routing with simultaneous pickup and delivery
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A branch-and-cut algorithm for the plant-cycle location problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
This page was built for publication: A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
