Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case (Q1296095)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case |
scientific article; zbMATH DE number 1314779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case |
scientific article; zbMATH DE number 1314779 |
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
0.8108119368553162
0 references
0.7773735523223877
0 references
0.7747666835784912
0 references
