TU Berlin

Prof. Dr. Andreas BleyPublications

Page Content

to Navigation


Bley, Andreas (2011). An Integer Programming Algorithm for Routing Optimization in IP Networks. Algorithmica, 21–45.

Boland, Natashia and Bley, Andreas and Fricke, Christopher and Froyland, Gary and Sotirov, Renata (2011). Clique-based facets for the precedence constrained knapsack problem. Mathematical Programming

Bley, Andreas and Martens, Maren and Menne, Ulrich and Wessäly, Roland (2011). Integrated optimization of aggregation and core for varying NGN architectures. Telecommunication Systems

Martens, Maren and Bley, Andreas (2011). Securely Connected Facility Location in Metric Graphs. Operations Research Proceedings 2010: Selected Papers of the Annual International Conference of the German Operations Research Society, Munich, Germany. Springer, 288–294.

Bley, Andreas and D'Andreagiovanni, Fabio and Hanemann, Andreas (2011). Robustness in Communication Networks: Scenarios and Mathematical Approaches. Proceedings of the 12th ITG-Fachtagung Photonische Netze, Leipzig, Germany. VDE Verlag, 105–112.

Arulselvan, Ashwin and Bley, Andreas and Gollowitzer, Stefan and Ljubic, Ivana and Maurer, Olaf (2011). MIP modeling of Incremental Connected Facility Location. Proceedings of the 5th International Network Optimization Conference (INOC 2011), Hamburg, Germany. Springer, 490–502.

Matuschke, Jannik and Bley, Andreas and Müller, Benjamin (2013). Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. Algorithms – ESA 2013. Springer, 707-718.


Quick Access

Schnellnavigation zur Seite über Nummerneingabe