The basic problem of vehicle scheduling can be solved by maximum bipartite matching (Q5369827): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 20:01, 5 March 2024
scientific article; zbMATH DE number 6793299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The basic problem of vehicle scheduling can be solved by maximum bipartite matching |
scientific article; zbMATH DE number 6793299 |
Statements
The basic problem of vehicle scheduling can be solved by maximum bipartite matching (English)
0 references
19 October 2017
0 references
public transport
0 references
single depot vehicle scheduling problem
0 references
basic vehicle scheduling problem
0 references
fleet minimization
0 references
bipartite graph matching
0 references
