The K king problem, an abstract model for computing aircraft landing trajectories: on modeling a dynamic hybrid system with constraints

DOI10.1287/IJOC.1070.0234zbMATH Open1243.90099OpenAlexW2036225077MaRDI QIDQ2901007FDOQ2901007

Authors: Konstantin Artiouchine, Philippe Baptiste, Juliette Mattioli 

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1070.0234

Recommendations

• Methods for solving of the aircraft landing problem. I: Exact solution methods
• scientific article; zbMATH DE number 1264442
• Displacement problem and dynamically scheduling aircraft landings
• An efficient hybrid meta-heuristic for aircraft landing problem
• Models and algorithms of automata theory for the control of an aircraft group

zbMATH Keywords

schedulingair-traffic controlconstraint-programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Cited In (2)

• Modal exact linearization of a class of second-order switched nonlinear systems
• The aircraft runway scheduling problem: a survey

This page was built for publication: The \(K\) king problem, an abstract model for computing aircraft landing trajectories: on modeling a dynamic hybrid system with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901007)