A multi-level bottleneck assignment approach to the bus drivers' rostering problem (Q792882): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(84)90071-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011647332 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4130999 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An augmenting path method for solving linear bottleneck assignment problems / rank | |||
Normal rank | |||
Latest revision as of 11:42, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multi-level bottleneck assignment approach to the bus drivers' rostering problem |
scientific article |
Statements
A multi-level bottleneck assignment approach to the bus drivers' rostering problem (English)
0 references
1984
0 references
work assignment for drivers
0 references
Multi-level Bottleneck Assignment
0 references
NP- complete
0 references
asymptotically optimal algorithm
0 references
computational results
0 references
