A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem (Q3391966)
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 Multiple Depot Vehicle Scheduling Problem |
scientific article; zbMATH DE number 5594887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem |
scientific article; zbMATH DE number 5594887 |
Statements
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem (English)
0 references
13 August 2009
0 references
0.897652268409729
0 references
0.8473222851753235
0 references
0.8293135166168213
0 references
0.8219314217567444
0 references
