Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets (Q3947440): 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 / OpenAlex ID | |||
| Property / OpenAlex ID: W2116453789 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets |
scientific article |
Statements
Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets (English)
0 references
1982
0 references
fixed periodic schedule
0 references
countably infinite partially ordered sets
0 references
posets
0 references
finite network flow problem
0 references
chain-cover problem
0 references
periodic posets
0 references
polynomial algorithm
0 references
