The basic problem of vehicle scheduling can be solved by maximum bipartite matching (Q5369827): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.14794/icai.9.2014.2.209 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2318208518 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:22, 30 July 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
