Department of Informatics,
University of Oslo
Telecommunications is (and has been for a long time) a rich source for challenging optimization problems. Typically such problems arise in connection with routing of traffic or design of telecom networks. In the talk we give some examples of such problems; they lead to structured linear programming or integer linear programming problems. We also explain the main ideas in cutting plane algorithms (based on solving LP relaxations) for solving some of these problems. Finally, some interesting new research issues are suggested.