A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
Year of publication: |
1 November 2018
|
---|---|
Authors: | Faye, Alain |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 270.2018, 3 (1.11.), p. 1148-1157
|
Subject: | OR in airlines | Aircraft Landing Problem | Landing times | Dynamic programming | Polynomial-time algorithm | Theorie | Theory | Dynamische Optimierung | Mathematische Optimierung | Mathematical programming | Fluggesellschaft | Airline | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Luftverkehr | Air transport |
-
Dynamic capacity allotment planning for airlines via travel agencies
Aydın, Nurşen, (2024)
-
Dynamic optimization for airline maintenance operations
Lagos, Carlos, (2020)
-
Barbato, Michele, (2024)
- More ...
-
Solving the Aircraft Landing Problem with time discretization approach
Faye, Alain, (2015)
-
A new upper bound for the 0-1 quadratic knapsack problem
Billionnet, Alain, (1999)
-
A new upper bound for the 0-1 quadratic knapsack problem
Billionnet, Alain, (1999)
- More ...