direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

B

Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E. and Widmayer, P..
Reconstructing Visibility Graphs with Simple Robots.
In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 87–99, 2009.

Link zur Publikation


Bjelde, A., Fischer, F. and Klimm, M..
Impartial Selection and the Power of Up to Two Choices.
In Proceedings of the 11th Conference on Web and Internet Economics (WINE), 2015.


Bjelde, A., Disser, Y., Hackfeld, J., Hansknecht, C., Lipmann, M., Meißner, J., Schewior, K., Schlöter, M. and Stougie, L..
Tight bounds for online TSP on the line.
In Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 994–1005, 2017.

Link zur Publikation Link zur Originalpublikation


Bley, A..
Node-Disjoint Length-Restricted Paths.
Diploma thesis, TU Berlin, 1997.


Bley, A., Grötschel, M. and Wessäly, R..
Design of Broadband Virtual Private Networks: Model and Heuristics for the B-WiN.
In N. Dean and D.F. Hsu and R. Ravi (ed.)Robust Communication Networks: Interconnection and Survivability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 53, pp. 1–16, AMS, 1998.

Link zur Publikation


Bley, A. and Koch, T..
Optimierung des G-WiN.
DFN-Mitteilungen, Vol. 54, pp. 13–15, 2000.

Link zur Publikation


Bley, A..
On the Complexity of Vertex-Disjoint Length-Restricted Path Problems.
Computational Complexity, Vol. 12, pp. 131–149, 2003.

Link zur Publikation


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

Link zur Publikation


Bley, A., Koster, A. M., Kröller, A., Wessäly, R. and Zymolka, A..
Kosten- und Qualitätsoptimierung in Kommunikationsnetzen.
Tele-Kommunikation Aktuell, Vol. 07/08, 2003.

Link zur Publikation


Bley, A. and Zymolka, A..
Planung kostenoptimaler Informations- und Kommunikations-Infrastrukturen.
In Proceedings of the 8th Kasseler Symposium Energie-Systemtechnik: Energie und Kommunikation, Kassel, Germany, pp. 61–77, ISET Kassel, 2003.

Link zur Publikation


Bley, A., Koch, T. and Wessäly, R..
Large-scale Hierarchical Networks: How to Compute an Optimal Architecture?..
In H. Kaindl (ed.)Proceedings of the 8th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2004), Vienna, Austria, pp. 429–434, VDE Verlag, 2004.

Link zur Publikation


Bley, A., Koster, A. M., Wessäly, R. and Zymolka, A..
Kostenoptimierung mit Garantie: Konfiguration und Design von Transportnetzen.
In Proceedings of the 6th ITG-Fachtagung Photonische Netze, Leipzig, Germany, VDE Verlag, 2004.

Link zur Publikation


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


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


Bley, A. and Pattloch, M..
Modellierung und Optimierung der X-WiN Plattform.
DFN-Mitteilungen, Vol. 67, pp. 4–7, 2005.

Link zur Publikation


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

Link zur Publikation


Bley, A., Kupzog, F. and Zymolka, A..
Auslegung heterogener Kommunikationsnetze nach Performance und Wirtschaftlichkeit.
In Proceedings of the 11th Kasseler Symposium Energie-Systemtechnik: Energie und Kommunikation, Kassel, Germany, pp. 84–97, ISET Kassel, 2006.



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

Link zur Publikation


Bley, A..
Routing and Capacity Optimization for IP Networks.
Doctoral thesis, TU Berlin, 2007.

Link zur Publikation


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

Link zur Publikation


Bley, A., Koch, T. and Niu, L..
Experiments with nonlinear extensions to SCIP.
Preprint 08-28, ZIB, 2008.

Link zur Publikation


Bley, A., Menne, U., Klähne, R., Raack, C. and Wessäly, R..
Multi-layer network design – A model-based optimization approach.
In Proceedings of the 5th Polish-German Teletraffic Symposium 2008, pp. 107–116, Berlin, Germany, 2008.


Bley, A..
Approximability of Unsplittable Shortest Path Routing Problems.
Networks, Vol. 54, pp. 23–46, 2009. Short version appeared in Proceedings of IPCO 2005..

Link zur Publikation


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

Link zur Publikation


Bley, A..
Logarithmic inapproximability results for the minimum shortest path routing conflict problem.
Preprint 025-2009, Institute of Mathematics, TU Berlin, 2009. Submitted to Networks.

Link zur Publikation


Bley, A., Boland, N., Fricke, C. and Froyland, G..
Clique-based facets for the precedence constrained knapsack problem.
In C. Stein and M. Uetz and T. Vredeveld (ed.)Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2009), Rolduc, The Netherlands, pp. 259–261, 2009.


Bley, A., Gleixner, A., Koch, T. and Vigerske, S..
Comparing MIQCP solvers on open pit mine production scheduling problems with stockpiling constraints.
Preprint 09-32, ZIB, 2009. Short version submitted to Modeling, Simulation and Optimization of Complex Processes: Proceedings of the 4th International Conference on High Performance Scientific Computing (HPSC 2009), Hanoi, Vietnam..

Link zur Publikation


Bley, A., Fortz, B., Gourdin, E., Holmberg, K., Klopfenstein, O., Pióro, M., Tomaszewski, A. and Ümit, H..
Optimization of OSPF Routing in IP Networks.
In A.M.C.A. Koster and X. Muñoz (ed.)Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks, chapter 8, pp. 199–240, Springer, 2010.


Bley, A., Boland, N., Fricke, C. and Froyland, G..
A strengthened formulation and cutting planes for the open pit mine production scheduling problem.
Computers and Operations Research, Vol. 37, pp. 1641–1647, 2010.


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

Link zur Publikation


Bley, A..
An Integer Programming Algorithm for Routing Optimization in IP Networks.
Algorithmica, Vol. 60, pp. 21–45, 2011. Short version appeared in Proceedings of ESA 2008..

Link zur Publikation


Bley, A., Martens, M., Menne, U. and Wessäly, R..
Integrated optimization of aggregation and core for varying NGN architectures.
Telecommunication Systems, 2011. To appear.


Bley, A., D'Andreagiovanni, F. and Hanemann, A..
Robustness in Communication Networks: Scenarios and Mathematical Approaches.
In Proceedings of the 12th ITG-Fachtagung Photonische Netze, Leipzig, Germany, pp. 105–112, VDE Verlag, 2011.


Böhmová, K., Disser, Y., Mihalák, M. and Sramek, R..
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.
In Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN), 2016. to appear.


Böhmova, K., Disser, Y., Kravina, E., Mihalák, M. and Widmayer, P..
Interval Selection on Unrelated Machines.
In Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2015. to appear.


Böhmová, K., Disser, Y., Mihalák, M. and Widmayer, P..
Interval Selection with Machine-Dependent Intervals.
In Proceedings of the 13th International Algorithms and Data Structures Symposium (WADS), pp. 170–181, 2013.

Link zur Publikation


Boland, N., Bley, A., Fricke, C., Froyland, G. and Sotirov, R..
Clique-based facets for the precedence constrained knapsack problem.
Mathematical Programming, 2011. To appear.


Bonifaci, V., Marchetti-Spaccamela, A., Stiller, S. and Wiese, A..
Feasibility Analysis in the Sporadic DAG Task Model.
In ECRTS, pp. 225-233, 2013.


Bonifaci, V., Marchetti-Spaccamela, A., Megow, N. and Wiese, A..
Polynomial-time exact schedulability tests for harmonic real-time tasks.
In Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013), pp. 236-245, 2013.

Link zur Publikation


Bonifaci, V., Chan, H.-L., Marchetti-Spaccamela, A. and Megow, N..
Algorithms and Complexity for Periodic Real-Time Scheduling.
Transactions on Algorithms, Vol. 9, pp. 601-619, 2012.

Link zur Publikation Link zur Originalpublikation


Bonifaci, V., Chan, H.-L., Marchetti-Spaccamela, A. and Megow, N..
Algorithms and Complexity for Periodic Real-Time Scheduling.
In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 1350–1359, 2010.

Link zur Publikation


Bonifaci, V., Marchetti-Spaccamela, A. and Stiller, S..
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.
Algorithmica, Vol. 62, pp. 1034-1049, 2012.


Bonifaci, V., Marchetti-Spaccamela, A. and Stiller, S..
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.
In Dan Halperin and Kurt Mehlhorn (ed.)Algorithms - ESA 2008, 16th Annual European Symposium on Algortihms, Lecture Notes in Computer Science, Vol. 5193, pp. 210-221, Springer, 2008.


Bonsma, P., Schulz, J. and Wiese, A..
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths.
In Proceedings of the 52th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011), IEEE, 2011. to appear.


Borndörfer, R., Möhring, R. and Skutella, M..
Towards better solutions in logistics with mathematics.
In Deuflhard, Peter and Grötschel, Martin and Hömberg, Dietmar and Horst, Ulrich and Kramer, Jürg and Mehrmann, Volker and Polthier, Konrad and Schmidt, Frank and Schütte, Christof and Skutella, Martin and Sprekels, Jürgen (ed.)\textscMatheon – Mathematics for Key Technologies, pp. 93–107, European Mathematical Society, 2014.


Borndörfer, R., Schenker, S., Skutella, M. and Strunk, T..
PolySCIP.
In Greuel, Gert-Martin and Koch, Thorsten and Paule, Peter and Sommese, Aandrew J. (ed.)Proceedings of the 5th International Conference on Mathematical Software, Lecture Notes in Computer Science, Vol. 9725, pp. 259–264, Springer, 2016.


Bosio, D., D., C., Groep, D., Guy, L., Reale, M., Salomoni, D., Templon, J. and Theile, M..
Distributed Testing Infrastructure and Processes for the EGEE Grid Middleware.
In Computing in High Energy and Nuclear Physics Conference (CHEP), pp. 754–757, 2004.



Burlacu, R., Egger, H., Groß, M., Martin, A., Pfetsch, M. E., Schewe, L., Sirvent, M. and Skutella, M..
Maximizing the storage capacity of gas networks: a global MINLP approach.
Optimization and Engineering, Vol. 20, pp. 543-–573, 2019.


Zusatzinformationen / Extras