Local authorities and public services
Description
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 |
Further explanation of this example:
'Applications of optimization with Xpress-MP', Chapter 15: Local authorities and public services
Source Files
By clicking on a file name, a preview is opened at the bottom of this page. Data Files
j3elect2.dat
! Data file for `j3elect_calc2.mos'
NEIGHB: [(1) [2, 5]
(2) [3, 5]
(3) [4, 5]
(4) [5, 10]
(5) [6, 10]
(6) [7, 8]
(7) [8, 9]
(8) [9, 10, 11]
(9) [11, 12]
(10) [11, 13]
(11) [12, 13]
(12) [14]
(13) [14] ]
POP: [30 50 20 70 20 40 30 30 40 60 10 60 40 40]
VOTES: [17.5 15 14.2 42 18 9 12 10 26 34 2.5 27 29 15]
MINPOP: 30
MAXPOP: 100
MINSINGLE: 50
|