direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments


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.

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 (2011). An Integer Programming Algorithm for Routing Optimization in IP Networks. Algorithmica, 21–45.

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

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.

Bienstock, Daniel and Bley, Andreas (2000). Capacitated Network Design with Multicast Commodities. Proceedings of the 8th International Conference on Telecommunication Systems (ICTSM 2000), Modeling and Analysis, Nashville, USA

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.

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe

Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.