direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments


vor >> [3]

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

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

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

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

Bley, Andreas (1997). Node-Disjoint Length-Restricted Paths [11]. TU Berlin

Bley, Andreas and Grötschel, Martin and Wessäly, Roland (1998). Design of Broadband Virtual Private Networks: Model and Heuristics for the B-WiN [12]. Robust Communication Networks: Interconnection and Survivability. AMS, 1–16.

Bley, Andreas and Koch, Thorsten (2000). Optimierung des G-WiN [13]. DFN-Mitteilungen, 13–15.

Bley, Andreas (2003). On the Complexity of Vertex-Disjoint Length-Restricted Path Problems [14]. Computational Complexity, 131–149.

Bley, Andreas (2003). A Lagrangian Approach for Integrated Network Design and Routing in IP Networks [15]. Proceedings of the 1st International Network Optimization Conference (INOC 2003), Paris, France, 107–113.

Bley, Andreas and Koster, Arie M.C.A. and Kröller, Alexander and Wessäly, Roland and Zymolka, Adrian (2003). Kosten- und Qualitätsoptimierung in Kommunikationsnetzen [16]. Tele-Kommunikation Aktuell

Bley, Andreas and Zymolka, Adrian (2003). Planung kostenoptimaler Informations- und Kommunikations-Infrastrukturen [17]. Proceedings of the 8th Kasseler Symposium Energie-Systemtechnik: Energie und Kommunikation, Kassel, Germany. ISET Kassel, 61–77.

Bley, Andreas and Koch, Thorsten and Wessäly, Roland (2004). Large-scale Hierarchical Networks: How to Compute an Optimal Architecture?. [18]. Proceedings of the 8th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2004), Vienna, Austria. VDE Verlag, 429–434.

Bley, Andreas and Koster, Arie M.C.A. and Wessäly, Roland and Zymolka, Adrian (2004). Kostenoptimierung mit Garantie: Konfiguration und Design von Transportnetzen [19]. Proceedings of the 6th ITG-Fachtagung Photonische Netze, Leipzig, Germany. VDE Verlag.

Bley, Andreas (2005). Finding Small Administrative Lengths for Shortest Path Routing [20]. Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, 121–128.

Bley, Andreas (2005). On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem [21]. Integer Programming and Combinatorial Optimization: Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany. Springer, 97–110.

vor >> [24]
------ Links: ------

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe

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