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; zbMATH DE number 5594918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Cut Algorithm for the Dial-a-Ride Problem |
scientific article; zbMATH DE number 5594918 |
Statements
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (English)
0 references
13 August 2009
0 references
0.91909504
0 references
0.91734207
0 references
0.9138675
0 references
0.9136597
0 references
0.9121481
0 references
0.90614724
0 references
0.8993068
0 references
