Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
type: Item
instance of: scholarly article
title: Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
zbMATH Open document ID: 1177.90336
author: Jean-François Cordeau
author: Manuel Iori
author: Mauro Dell'Amico
published in: Computers \& Operations Research
publication date: 2009-12-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5651584
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: pickup and delivery
zbMATH Keywords: FIFO loading
zbMATH Keywords: branch-and-cut
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
full work available at URL: j.cor.2009.08.003
OpenAlex ID: W2033271291
Wikidata QID: Q59222254
cites work: Q3523238
cites work: The pickup and delivery traveling salesman problem with first-in-first-out loading
cites work: An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
cites work: Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
cites work: A new extension of local search applied to the Dial-A-Ride problem
cites work: A heuristic for the pickup and delivery traveling salesman problem
cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem
cites work: An algorithm for the traveling salesman problem with pickup and delivery customers
cites work: The pickup and delivery problem: Faces and branch-and-cut algorithm
cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
cites work: Q5323551
cites work: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: Q4398361
cites work: Q4532225
cites work: Q3714900
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
DOI: 10.1016/J.COR.2009.08.003
description: scientific article; zbMATH DE number 5651584