The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
type: Item
instance of: scholarly article
title: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
zbMATH Open document ID: 1176.90055
author: Hipólito Hernández-Pérez
author: Juan-José Salazar-González
published in: European Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 5642761
zbMATH Keywords: traveling salesman
zbMATH Keywords: pickup-and-delivery
zbMATH Keywords: branch-and-cut
zbMATH Keywords: dial-a-ride
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.05.009
OpenAlex ID: W2007496263
cites work: The swapping problem
cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: Network Design Using Cut Inequalities
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
cites work: The dial-a-ride problem: Models and algorithms
cites work: Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
cites work: Exact solution of multicommodity network optimization problems with general step cost functions
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: On extended formulations for the precedence constrained asymmetric traveling salesman problem
cites work: Routing a vehicle of capacity greater than one
cites work: A new extension of local search applied to the Dial-A-Ride problem
cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
cites work: A generalization of max flow—min cut
cites work: An algorithm for the traveling salesman problem with pickup and delivery customers
cites work: HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
cites work: Projections of the capacitated network loading problem
cites work: The travelling salesman problem with pick-up and delivery
cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem
cites work: A heuristic for the pickup and delivery traveling salesman problem
cites work: The pickup and delivery problem: Faces and branch-and-cut algorithm
DOI: 10.1016/J.EJOR.2008.05.009
description: scientific article; zbMATH DE number 5642761