Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case (Q1296095): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:06, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case |
scientific article |
Statements
Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case (English)
0 references
10 September 2000
0 references
periodic scheduling
0 references
airplane scheduling
0 references
polynomial algorithms
0 references
assignment problem
0 references
