On solution to uniform partitioning problem for airline flight schedule: exact mathematical formulation

Бесплатный доступ

The uniform partitioning problem for flight schedule is discussed in the paper as an integer program. An algorithmic solution to this problem enables one to effectively reduce problem dimensions and hence significantly simplify and accelerate corresponding business process of an airline crew planning. Correctness of exact mathematical formulation is verified by numerical calculations for model initial data.

Planning, airline crew planning, mathematical model, optimization problem, set partitioning problem, branch and bound method

Короткий адрес: https://sciup.org/14875673

IDR: 14875673

Статья научная