Methods for solving of the aircraft landing problem. I: Exact solution methods

DOI10.1134/S0005117919070099zbMath1429.90029OpenAlexW2961668229MaRDI QIDQ2331478

G. S. Veresnikov, N. A. Egorov, V. G. Lebedev, E. L. Kulida

Publication date: 29 October 2019

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117919070099

zbMATH Keywords

linear programmingair trafficbranch and bound methodobjective functionsaircraft landing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

The aircraft runway scheduling problem: a survey ⋮ Methods for solving of the aircraft landing problem. II: Approximate solution methods

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• A dynamic programming approach for the aircraft landing problem with aircraft classes
• Aircraft landing problems with aircraft classes
• Improved rolling horizon approaches to the aircraft sequencing problem
• Scheduling aircraft landings using airlines' preferences
• Solving the aircraft landing problem with time discretization approach
• Scheduling Aircraft Landings—The Static Case
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Scheduling aircraft landings at London Heathrow using a population heuristic
• Displacement problem and dynamically scheduling aircraft landings

This page was built for publication: Methods for solving of the aircraft landing problem. I: Exact solution methods