Problem name and type, features | Difficulty | Related examples |
F‑1 | Flight connections at a hub: Assignment problem | * | assignment_graph.mos, i1assign.mos, c6assign.mos |
| |
F‑2 | Composing flight crews: Bipartite matching | **** | matching_graph.mos |
| 2 problems, data preprocessing, incremental definition of data array, encoding of arcs, logical or (cumulative version) and and, procedure for printing solution, forall-do, max, finalize |
F‑3 | Scheduling flight landings: Scheduling problem with time windows | *** | |
| generalization of model to arbitrary time windows; calculation of specific BigM, forall-do |
F‑4 | Airline hub location: Hub location problem | *** | |
| quadruple indices; improved (re)formulation (first model not usable with student version), union of index (range) sets |
F‑5 | Planning a flight tour: Symmetric traveling salesman problem | ***** | tsp_graph.mos |
| loop over problem solving, TSP subtour elimination algorithm; procedure for generating additional constraints, recursive subroutine calls, working with sets, forall-do, repeat-until, getsize, not |
Further explanation of this example:
'Applications of optimization with Xpress-MP', Chapter 11: Air transport