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...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 344; no. 1; pp. 479 - 498
Main Authors:	Cao, Bin, Xu, Chao
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2025 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!