Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case (Q1296095): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q127230271, #quickstatements; #temporary_batch_1721940658196 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3236250 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127230271 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:52, 25 July 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
