TU Berlin

Prof. Dr. Andreas BleyPublications

Page Content

to Navigation

Publications

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.


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.


Bley, Andreas and Fortz, Bernard and Gourdin, Eric and Holmberg, Kaj and Klopfenstein, Olivier and Pióro, Michal and Tomaszewski, Artur and Ümit, Hakan (2010). Optimization of OSPF Routing in IP Networks. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks. Springer, 199–240.


Bley, Andreas and Boland, Natashia and Fricke, Christopher and Froyland, Gary (2010). A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Computers and Operations Research, 1641–1647.


Menne, Ulrich and Wessäly, Roland and Martens, Maren and Bley, Andreas (2010). Integrated optimization of aggregation and core for varying NGN architectures. Proceedings of the 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2010), Warsaw, Poland. IEEE, 228–233.


Bley, Andreas and Neto, Jose (2010). Approximability of 3- and 4-hop bounded disjoint paths problems. Integer Programming and Combinatorial Optimization: Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Switzerland. Springer, 205–218.


Bley, Andreas (2009). Approximability of Unsplittable Shortest Path Routing Problems. Networks, 23–46.


Bley, Andreas (2009). On the Hardness of Finding Small Shortest Path Routing Conflicts. Proceedings of the 4th International Network Optimization Conference (INOC 2009), Pisa, Italy



Bley, Andreas and Boland, Natashia and Fricke, Christopher and Froyland, Gary (2009). Clique-based facets for the precedence constrained knapsack problem. Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2009), Rolduc, The Netherlands, 259–261.


Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe