A branch and bound algorithm for the multiple depot vehicle scheduling problem (Q3826353)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the multiple depot vehicle scheduling problem |
scientific article |
Statements
A branch and bound algorithm for the multiple depot vehicle scheduling problem (English)
0 references
1989
0 references
vehicle scheduling
0 references
NP-hard multiple depot case
0 references
lower bounds
0 references
connectivity constraints
0 references
strong dominance procedure
0 references
branch and bound
0 references
Computational results
0 references
