direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications

Bley, Andreas (1997). Node-Disjoint Length-Restricted Paths. 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. Robust Communication Networks: Interconnection and Survivability. AMS, 1–16.


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


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


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


Bley, Andreas (2003). A Lagrangian Approach for Integrated Network Design and Routing in IP Networks. 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. Tele-Kommunikation Aktuell


Bley, Andreas and Zymolka, Adrian (2003). Planung kostenoptimaler Informations- und Kommunikations-Infrastrukturen. 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?.. 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. Proceedings of the 6th ITG-Fachtagung Photonische Netze, Leipzig, Germany. VDE Verlag.


Bley, Andreas (2005). Finding Small Administrative Lengths for Shortest Path Routing. 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. Integer Programming and Combinatorial Optimization: Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany. Springer, 97–110.


Bley, Andreas and Pattloch, Marcus (2005). Modellierung und Optimierung der X-WiN Plattform. DFN-Mitteilungen, 4–7.


Bley, Andreas and Koch, Thorsten (2006). Integer Programming Approaches to Access and Backbone IP-Network Planning. Modeling, Simulation and Optimization of Complex Processes: Proceedings of the 3rd International Conference on High Performance Scientific Computing, Hanoi, Vietnam. Springer, 87–110.


Bley, Andreas and Kupzog, Friedrich and Zymolka, Adrian (2006). Auslegung heterogener Kommunikationsnetze nach Performance und Wirtschaftlichkeit. Proceedings of the 11th Kasseler Symposium Energie-Systemtechnik: Energie und Kommunikation, Kassel, Germany. ISET Kassel, 84–97.


Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe