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ženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 344; číslo 1; s. 479 - 498
Hlavní autoři:	Cao, Bin, Xu, Chao
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2025 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!