A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Cut Algorithm for the Dial-a-Ride Problem |
scientific article |
Statements
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (English)
0 references
13 August 2009
0 references
