direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications

Bley, Andreas and Gleixner, Ambros and Koch, Thorsten and Vigerske, Stefan (2009). Comparing MIQCP solvers on open pit mine production scheduling problems with stockpiling constraints.


Bley, Andreas (2008). An Integer Programming Algorithm for Routing Optimization in IP Networks. Algorithms – ESA 2008: Proceedings of the 16th Annual European Symposium on Algorithms, Karlsruhe, Germany. Springer, 198–209.


Bley, Andreas and Koch, Thorsten and Niu, Lingfeng (2008). Experiments with nonlinear extensions to SCIP.


Bley, Andreas and Menne, Ulrich and Klähne, Roman and Raack, Christian and Wessäly, Roland (2008). Multi-layer network design – A model-based optimization approach. Proceedings of the 5th Polish-German Teletraffic Symposium 2008, 107–116.



Bley, Andreas (2007). Routing and Capacity Optimization for IP Networks. Operations Research Proceedings 2007: Selected Papers of the Annual International Conference of the German Operations Research Society, Saarbrücken, Germany. Springer, 9–16.


Bley, Andreas (2007). Routing and Capacity Optimization for IP Networks. TU Berlin


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.


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 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 (2003). On the Complexity of Vertex-Disjoint Length-Restricted Path Problems. Computational Complexity, 131–149.


Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

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