A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes (Q724035)
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: A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes |
scientific article; zbMATH DE number 6910076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes |
scientific article; zbMATH DE number 6910076 |
Statements
A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes (English)
0 references
25 July 2018
0 references
OR in airlines
0 references
aircraft landing problem
0 references
landing times
0 references
dynamic programming
0 references
polynomial-time algorithm
0 references
0.8684033
0 references
0.8571254
0 references
0.85334146
0 references
0.8505246
0 references
0.8473692
0 references
0.83823246
0 references
0.8332258
0 references
0.83110213
0 references
0.8285955
0 references
