A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
type: Item
instance of: scholarly article
title: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
zbMATH Open document ID: 1167.90681
author: Jean-François Cordeau
published in: Operations Research
publication date: 2009-08-13T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 5594918
MaRDI profile type: Publication
OpenAlex ID: W2051358678
DOI: 10.1287/OPRE.1060.0283
Recommended article: An effective and fast heuristic for the dial-a-ride problem
Recommended article: The dial-a-ride problem: Models and algorithms
Recommended article: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
Recommended article: A Matheuristic for the Dial-a-Ride Problem
Recommended article: Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Recommended article: A branch-and-cut algorithm for vehicle routing problems
Recommended article: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
Recommended article: HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
description: scientific article