| Problem name and type, features | Difficulty | Related examples |
| G‑1 | Network reliability: Maximum flow with unitary capacities | *** | maxflow_graph.mos, j1water.mos |
|---|
| encoding of arcs, range, exists, create, algorithm for printing paths, forall-do, while-do, round, list handling |
| G‑2 | Dimensioning of a mobile phone network | ** | |
|---|
| if-then, exit |
| G‑3 | Routing telephone calls: Multi-commodity network flow problem | *** | multicomflow_graph.mos |
|---|
| encoding of paths, finalize, getsize |
| G‑4 | Construction of a cabled network: Minimum weight spanning tree problem | *** | spanningtree_graph.mos |
|---|
| formulation of constraints to exclude subcycles |
| G‑5 | Scheduling of telecommunications via satellite: Preemptive open shop scheduling | ***** | openshop_graph.mos |
|---|
| data preprocessing, algorithm for preemptive scheduling that involves looping over optimization, ``Gantt chart'' printing |
| G‑6 | Location of GSM transmitters: Covering problem | * | covering_graph.mos, d5cutsh.mos, j2bigbro.mos |
|---|
| modeling an equivalence; sparse data format |
Further explanation of this example:
'Applications of optimization with Xpress-MP', Chapter 12: Telecommunication problems
