An exact branch and cut algorithm for the vehicle and crew scheduling problem (Q4699372)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1361553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact branch and cut algorithm for the vehicle and crew scheduling problem |
scientific article; zbMATH DE number 1361553 |
Statements
1 February 2000
0 references
vehicle and crew scheduling problem
0 references
urban public transport
0 references
column generation algorithm
0 references
polyhedral cuts
0 references
clique detection
0 references
0.8393240571022034
0 references
0.8367558121681213
0 references
0.8242391347885132
0 references
0.8213262557983398
0 references
0.8191893100738525
0 references
An exact branch and cut algorithm for the vehicle and crew scheduling problem (English)
0 references