A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes

The aircraft landing problem (ALP) is an important issue of assigning an airport’s runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts in practice. A large number of the extant studies have tried to address such a practical problem with using various algorithm...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of operations research Ročník 344; číslo 1; s. 479 - 498
Hlavní autori:	Cao, Bin, Xu, Chao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2025 Springer Nature B.V
Predmet:	Aircraft Aircraft landing Algorithms Business and Management Combinatorics Linear programming Minimum cost Operations Research/Decision Theory Original - OR Modeling/Case Study Runways Schedules Theory of Computation Min-cost flow static single-runway system Scheduling Polynomial-time algorithm Aircraft landing problem
ISSN:	0254-5330, 1572-9338
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!