| |
|
Description: |
In this talk, we will have a rapid look at diverse problems arising in the context of network design. We start with a brief introduction to enumeration techniques used in integer programming. Then, we present different problems occurring in telecommunications and electrical power systems. We study some of their characteristics and present efficient solution methods. Finally, we take a closer look at an important substructure, the knapsack problem, and study its properties in the stochastic context. Both worst-time complexity results and efficient branch-and-cut algorithms are presented for the problem.
|
|
Date: |
|
| Start Time: |
11:30 |
|
Speaker: |
Michael Poss (Univ. Libre de Bruxelles, Belgium)
|
|
Institution: |
Univ. Libre de Bruxelles
|
| Research Groups: |
-Numerical Analysis and Optimization
|
|
See more:
|
<Main>
|
|
