Problem name and type, features | Difficulty | Related examples |
J‑1 | Water conveyance / water supply management: Maximum flow problem | ** | j1water_graph.mos, g1rely.mos |
| encoding of arcs, selection with `|', record data structure |
J‑2 | CCTV surveillance: Maximum vertex cover problem | ** | j2bigbro_graph.mos, g6transmit.mos, d5cutsh.mos |
| encoding of network, exists |
J‑3 | Rigging elections: Partitioning problem | **** | j3elect_graph.mos, partitioning_graph.mos |
| algorithm for data preprocessing; file inclusion, 3 nested/recursive procedures, working with sets, if-then, forall-do, exists, finalize |
J‑4 | Gritting roads: Directed Chinese postman problem | **** | j4grit_graph.mos |
| algorithm for finding Eulerian path/graph for printing; encoding of arcs, dynamic array, exists, 2 functions implementing Eulerian circuit algorithm, round, getsize, break, while-do, if-then-else, list handling |
J‑5 | Location of income tax offices: p-median problem | **** | |
| modeling an implication, all-pairs shortest path algorithm (Floyd-Warshall); dynamic array, exists, procedure for shortest path algorithm, forall-do, if-then, selection with `|' |
J‑6 | Efficiency of hospitals: Data Envelopment Analysis (DEA) | *** | |
| description of DEA method; loop over problem solving with complete re-definition of problem every time, naming and declaring constraints |
'Applications of optimization with Xpress-MP', Chapter 15: Local authorities and public services