Open UTDAcademic Journal Reviews
10.1287/opre.1060.0283
ArticleOperations Research

A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Jean-François Cordeau
2006Volume 54 · Issue 3pp. 573-586
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.