FICO
FICO Xpress Optimization Examples Repository
FICO Optimization Community FICO Xpress Optimization Home
Back to examples browserPrevious exampleNext example

Telecommunication problems

Description
Problem name and type, featuresDifficultyRelated 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

mosel_app_7.zip[download all files]

Source Files
By clicking on a file name, a preview is opened at the bottom of this page.
g1rely.mos[download]
g2dimens.mos[download]
g3routing.mos[download]
g4cable.mos[download]
g5satell.mos[download]
g6transmit.mos[download]

Data Files
g1rely.dat[download]
g2dimens.dat[download]
g3routing.dat[download]
g4cable.dat[download]
g5satell.dat[download]
g6transmit.dat[download]




g6transmit.dat

! Data file for `g6transmit.mos'

COST: [1.8 1.3 4.0 3.5 3.8 2.6 2.1]

COVER: [(1  1) 1 (1  2) 1 (1  4) 1
        (2  2) 1 (2  3) 1 (2  5) 1
        (3  4) 1 (3  7) 1 (3  8) 1 (3 10) 1
        (4  5) 1 (4  6) 1 (4  8) 1 (4  9) 1
        (5  8) 1 (5  9) 1 (5 12) 1
        (6  7) 1 (6 10) 1 (6 11) 1 (6 12) 1 (6 15) 1
        (7 12) 1 (7 13) 1 (7 14) 1 (7 15) 1]

POP: [2 4 13 6 9 4 8 12 10 11 6 14 9 3 6]

BUDGET: 10
Back to examples browserPrevious exampleNext example
© Copyright 2024 Fair Isaac Corporation.