Dokument-ID Dokumenttyp Verfasser/Autoren Herausgeber Haupttitel Abstract Auflage Verlagsort Verlag Erscheinungsjahr Seitenzahl Schriftenreihe Titel Schriftenreihe Bandzahl ISBN Quelle der Hochschulschrift Konferenzname Quelle:Titel Quelle:Jahrgang Quelle:Heftnummer Quelle:Erste Seite Quelle:Letzte Seite URN DOI Abteilungen OPUS4-5166 misc Werner, Axel; Aurzada, Frank; Bley, Andreas; Eisenblätter, Andreas; Geerdes, Hans-Florian; Guillemard, Mijail; Kutyniok, Gitta; Philipp, Friedrich; Raack, Christian; Scheutzow, Michael Deuflhard, Peter; Grötschel, Martin; Hömberg, Dietmar; Horst, Ulrich; Kramer, Jürg; Mehrmann, Volker; Polthier, Konrad; Schmidt, Frank; Schütte, Christof; Skutella, Martin; Sprekels, Jürgen Mathematics for telecommunications EMS Series in Industrial and Applied Mathematics European Mathematical Society 2014 14 MATHEON - Mathematics for Key Technologies 1 75 89 10.4171/137 Mathematical Optimization OPUS4-6270 Wissenschaftlicher Artikel Heinze, Rieke; Dipankar, Anurag; Henken, Cintia Carbajal; Moseley, Christopher; Sourdeval, Odran; Trömel, Silke; Xie, Xinxin; Adamidis, Panos; Ament, Felix; Baars, Holger; Barthlott, Christian; Behrendt, Andreas; Blahak, Ulrich; Bley, Sebastian; Brdar, Slavko; Brueck, Matthias; Crewell, Susanne; Deneke, Hartwig; Di Girolamo, Paolo; Evaristo, Raquel; Fischer, Jürgen; Frank, Christopher; Friederichs, Petra; Göcke, Tobias; Gorges, Ksenia; Hande, Luke; Hanke, Moritz; Hansen, Akio; Hege, Hans-Christian; Hose, Corinna; Jahns, Thomas; Kalthoff, Norbert; Klocke, Daniel; Kneifel, Stefan; Knippertz, Peter; Kuhn, Alexander; van Laar, Thriza; Macke, Andreas; Maurer, Vera; Mayer, Bernhard; Meyer, Catrin I.; Muppa, Shravan K.; Neggers, Roeland A. J.; Orlandi, Emiliano; Pantillon, Florian; Pospichal, Bernhard; Röber, Niklas; Scheck, Leonhard; Seifert, Axel; Seifert, Patric; Senf, Fabian; Siligam, Pavan; Simmer, Clemens; Steinke, Sandra; Stevens, Bjorn; Wapler, Kathrin; Weniger, Michael; Wulfmeyer, Volker; Zängl, Günther; Zhang, Dan; Quaas, Johannes Large-eddy simulations over Germany using ICON: a comprehensive evaluation Large-eddy simulations (LES) with the new ICOsahedral Non-hydrostatic atmosphere model (ICON) covering Germany are evaluated for four days in spring 2013 using observational data from various sources. Reference simulations with the established Consortium for Small-scale Modelling (COSMO) numerical weather prediction model and further standard LES codes are performed and used as a reference. This comprehensive evaluation approach covers multiple parameters and scales, focusing on boundary-layer variables, clouds and precipitation. The evaluation points to the need to work on parametrizations influencing the surface energy balance, and possibly on ice cloud microphysics. The central purpose for the development and application of ICON in the LES configuration is the use of simulation results to improve the understanding of moist processes, as well as their parametrization in climate models. The evaluation thus aims at building confidence in the model's ability to simulate small- to mesoscale variability in turbulence, clouds and precipitation. The results are encouraging: the high-resolution model matches the observed variability much better at small- to mesoscales than the coarser resolved reference model. In its highest grid resolution, the simulated turbulence profiles are realistic and column water vapour matches the observed temporal variability at short time-scales. Despite being somewhat too large and too frequent, small cumulus clouds are well represented in comparison with satellite data, as is the shape of the cloud size spectrum. Variability of cloud water matches the satellite observations much better in ICON than in the reference model. In this sense, it is concluded that the model is fit for the purpose of using its output for parametrization development, despite the potential to improve further some important aspects of processes that are also parametrized in the high-resolution model. 2017 31 Quarterly Journal of the Royal Meteorological Society 143 702 69 100 10.1002/qj.2947 Visual Data Analysis OPUS4-616 misc Bley, Andreas; Koch, Thorsten Optimierung in der Planung und beim Aufbau des G-WiN Ende Juni diesen Jahres wurde das Gigabit-Wissenschaftsnetz offiziell gestartet. In der zweijährigen Vorbereitungsphase wurden nicht nur die technischen Möglichkeiten der neuen Übertragungstechniken und Dienste getestet. Es wurden auch verschiedene Fragestellungen zum effizienten Einsatz der verfügbaren Ressourcen für den Betrieb des G-WiN untersucht. In diesem Artikel beschreiben wir, wie das G-WiN zu seiner jetzigen Struktur und Topologie gekommen ist. 2000 urn:nbn:de:0297-zib-6169 ZIB Allgemein OPUS4-708 misc Bley, Andreas; Koch, Thorsten Integer programming approaches to access and backbone IP-network planning In this article we study the problem of designing a nation-wide communication network. Such networks usually consist of an access layer, a backbone layer, and maybe several intermediate layers. The nodes of each layer must be connected to those of the next layer in a tree-like fashion. The backbone layer has to satisfy certain survivability and routing constraints. Given the node locations, the demands between them, the possible connections and hardware configurations, and various other technical and administrational constraints, the goal is to decide, which node is assigned to which network level, how the nodes are connected, what hardware must be installed, and how traffic is routed in the backbone. Mixed integer linear programming models and solution methods are presented for both the access and the backbone network design problem. The focus is on the design of IP-over-SDH networks, but the access network design model and large parts of the backbone network design models are general and also applicable for other types of communication networks. Results obtained with these methods in the planning of the German research network are presented. 2002 urn:nbn:de:0297-zib-7081 ZIB Allgemein OPUS4-838 misc Bley, Andreas Inapproximability Results for the Inverse Shortest Paths Problem with Integer Length and Unique Shortest Paths We study the complexity of two Inverse Shortest Paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph, the task is to find positive integer arc lengths such that the given paths are uniquely determined shortest paths between their respective terminals. The first problem seeks for arc lengths that minimize the length of the longest of the prescribed paths. In the second problem, the length of the longest arc is to be minimized. We show that it is $np-hard$ to approximate the minimal longest path length within a factor less than $8/7$ or the minimal longest arc length within a factor less than $9/8$. This answers the (previously) open question whether these problems are $np-hard$ or not. We also present a simple algorithm that achieves an $\mathcal{O}(|V|)$-approximation guarantee for both variants. Both ISP problems arise in the planning of telecommunication networks with shortest path routing protocols. Our results imply that it is $\mathcal{NP}$-hard to decide whether a given path set can be realized with a real shortest path routing protocol such as OSPF, IS-IS, or RIP. 2005 urn:nbn:de:0297-zib-8388 ZIB Allgemein OPUS4-830 misc Bley, Andreas; Koch, Thorsten; Niu, Lingfeng Experiments with nonlinear extensions to SCIP This paper describes several experiments to explore the options for solving a class of mixed integer nonlinear programming problems that stem from a real-world mine production planning project. The only type of nonlinear constraints in these problems are bilinear equalities involving continuous variables, which enforce the ratios between elements in mixed material streams. A branch-and-bound algorithm to handle the integer variables has been tried in another project. However, this branch-and-bound algorithm is not effective for handling the nonlinear constraints. Therefore state-of-the-art nonlinear solvers are utilized to solve the resulting nonlinear subproblems in this work. The experiments were carried out using the NEOS server for optimization. After finding that current nonlinear programming solvers seem to lack suitable preprocessing capabilities, we preprocess the instances beforehand and use an heuristic approach to solve the nonlinear subproblems. In the appendix, we explain how to add a polynomial constraint handler that uses IPOPT as embedded nonlinear programming solver for the constraint programming framework SCIP. This is one of the crucial steps for implementing our algorithm in SCIP. We briefly described our approach and give an idea of the work involved. 2008 urn:nbn:de:0297-zib-8300 Mathematical Optimization OPUS4-855 misc Bley, Andreas; Pattloch, Marcus Modellierung und Optimierung der X-WiN Plattform In diesem Artikel werden die Optimierungsmodelle und -verfahren beschrieben, die bei der Planung des Kernnetzes und der Zugangsinfrastruktur des X-WiN verwendet wurden. 2005 urn:nbn:de:0297-zib-8551 ZIB Allgemein OPUS4-751 misc Bley, Andreas A Lagrangian Approach for Integrated Network Design and Routing in IP Networks We consider the problem of designing a network that employs a non-bifurcated shortest path routing protocol. The network's nodes and the set of potential links are given together with a set of forecasted end-to-end traffic demands. All relevant hardware components installable at links or nodes are considered. The goal is to simultaneously choose the network's topology, to decide which hardware components to install on which links and nodes, and to find appropriate routing weights such that the overall network cost is minimized. In this paper, we present a mathematical optimization model for this problem and an algorithmic solution approach based on a Lagrangian relaxation. Computational results achieved with this approach for several real-world network planning problems are reported. 2003 urn:nbn:de:0297-zib-7515 ZIB Allgemein OPUS4-753 misc Bley, Andreas; Koster, Arie M.C.A.; Kröller, Alexander; Wessäly, Roland; Zymolka, Adrian Kosten- und Qualitätsoptimierung in Kommunikationsnetzen Der scharfe Wettbewerb innerhalb der Telekommunikationsbranche zwingt die Netzbetreiber dazu, ihre Investitionen genau zu planen und immer wieder Einsparungsmanahmen durchzuführen. Gleichzeitig ist es jedoch wichtig, die Qualität der angebotenen Dienste zu verbessern, um neue Kunden zu gewinnen und langfristig an sich zu binden. Die mathematische Optimierung bietet sich für viele solcher Aufgabenstellungen als hervorragend geeignetes Planungswerkzeug an. Ziel dieses Artikels ist es, ihre Methodik und ihre Anwendung speziell zur Kosten- und Qualitätsoptimierung in Kommunikationsnetzen vorzustellen. Anhand von vier konkreten Planungsaufgaben aus dem Bereich der Festnetzplanung wird aufgezeigt, wie sich komplexe Zusammenhänge in flexiblen mathematischen Modellen abbilden lassen und welche Verfahren zur automatisierten Bearbeitung der Probleme eingesetzt werden können. Die hier vorgestellten Methoden zeichnen sich insbesondere dadurch aus, dass sie neben hochwertigen Lösungen auch eine Qualittsgarantie liefern, mit der sich die Lsungen fundiert bewerten lassen. Die dokumentierten Ergebnisse aus verschiedenen Industrieprojekten belegen die Eignung und Güte der mathematischen Optimierung für die Praxis. 2003 urn:nbn:de:0297-zib-7537 ZIB Allgemein OPUS4-759 misc Bley, Andreas; Zymolka, Adrian Planung kostenoptimaler Informations- und Kommunikations-Infrastrukturen Beim Entwurf und Ausbau von Informations- und Kommunikationsnetzwerken m{ü}ssen zahlreiche interdependente Entscheidungen getroffen und gleichzeitig mannigfaltige Bedingungen ber{ü}cksichtigt werden. Die verf{ü}gbaren technischen und organisatorischen Alternativm{ö}glichkeiten sind normalerweise so vielf{ä}ltig und komplex, dass eine manuelle Planung praktisch nicht m{ö}glich ist. In diesem Artikel wird das Potential und die Methodik der mathematischen Optimierung bei der kostenoptimalen Planung von Kommunikationsnetzen vorgestellt. Als Ausgangspunkt wird exemplarisch eine typische praktische Aufgabe, die Struktur- und Konfigurationsplanung mehrstufiger Telekommunikationsnetzwerke, dargestellt. Anschließend werden kurz die wesentlichen Modellierungstechniken und Verfahrensans{ä}tze der mathematischen Optimierung skizziert. Abschließend gehen wir auf die Planung einer ad{ä}quaten Informations- und Kommunikations- Infrastruktur f{ü}r ein dezentrales Energieversorgungsnetz ein. 2003 urn:nbn:de:0297-zib-7591 ZIB Allgemein OPUS4-779 misc Bley, Andreas; Koch, Thorsten; Wessäly, Roland Large-scale hierarchical networks: How to compute an optimal architecture? In this article, we present a mathematical model and an algorithm to support one of the central strategic planning decisions of network operators: How to organize a large number of locations into a hierarchical network? We propose a solution approach that is based on mixed-integer programming and Lagrangian relaxation techniques. As major advantage, our approach provides not only solutions but also worst-case quality guarantees. Real-world scenarios with more than 750 locations have been solved within 30 minutes to less than 1\% off optimality. 2004 urn:nbn:de:0297-zib-7799 ZIB Allgemein OPUS4-1127 misc Bley, Andreas On the Hardness of Finding Small Shortest Path Routing Conflicts Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing paths forms a valid routing and, if this is not the case, to find a small subset of the given paths that cannot be shortest paths simultaneously for any routing lengths. In this paper we show that it is NP-hard to approximate the size of the smallest shortest path conflict by a factor less than 7/6. 2009 urn:nbn:de:0297-zib-11276 Mathematical Optimization OPUS4-1150 misc Bley, Andreas; Gleixner, Ambros; Koch, Thorsten; Vigerske, Stefan Comparing MIQCP solvers to a specialised algorithm for mine production scheduling In this paper we investigate the performance of several out-of-the box solvers for mixed-integer quadratically constrained programmes (MIQCPs) on an open pit mine production scheduling problem with mixing constraints. We compare the solvers BARON, Couenne, SBB, and SCIP to a problem-specific algorithm on two different MIQCP formulations. The computational results presented show that general-purpose solvers with no particular knowledge of problem structure are able to nearly match the performance of a hand-crafted algorithm. 2009 urn:nbn:de:0297-zib-11507 10.1007/978-3-642-25707-0 Mathematical Optimization OPUS4-1081 misc Bley, Andreas An Integer Programming Algorithm for Routing Optimization in IP Networks Most data networks nowadays use shortest path protocols to route the traffic. Given administrative routing lengths for the links of the network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. In this paper, we present an integer programming algorithm for the minimum congestion unsplittable shortest path routing problem, which arises in the operational planning of such networks. Given a capacitated directed graph and a set of communication demands, the goal is to find routing lengths that define a unique shortest path for each demand and minimize the maximum congestion over all links in the resulting routing. We illustrate the general decomposition approach our algorithm is based on, present the integer and linear programming models used to solve the master and the client problem, and discuss the most important implementational aspects. Finally, we report computational results for various benchmark problems, which demonstrate the efficiency of our algorithm. 2008 urn:nbn:de:0297-zib-10814 Mathematical Optimization OPUS4-896 misc Bley, Andreas Approximability of Unsplittable Shortest Path Routing Problems In this paper, we discuss the relation of unsplittable shortest path routing (USPR) to other routing schemes and study the approximability of three USPR network planning problems. Given a digraph $D=(V,A)$ and a set $K$ of directed commodities, an USPR is a set of flow paths $\Phi_{(s,t)}$, $(s,t)\in K$, such that there exists a metric $\lambda=(\lambda_a)\in \mathbb{Z}^A_+$ with respect to which each $\Phi_{(s,t)}$ is the unique shortest $(s,t)$-path. In the \textsc{Min-Con-USPR} problem, we seek for an USPR that minimizes the maximum congestion over all arcs. We show that this problem is hard to approximate within a factor of $\mathcal{O}(|V|^{1-\epsilon})$, but easily approximable within min$(|A|,|K|)$ in general and within $\mathcal{O}(1)$ if the underlying graph is an undirected cycle or a bidirected ring. We also construct examples where the minimum congestion that can be obtained by USPR is a factor of $\Omega(|V|^2)$ larger than that achievable by unsplittable flow routing or by shortest multi-path routing, and a factor of $\Omega(|V|)$ larger than by unsplittable source-invariant routing. In the CAP-USPR problem, we seek for a minimum cost installation of integer arc capacities that admit an USPR of the given commodities. We prove that this problem is $\mathcal{NP}$-hard to approximate within $2-\epsilon$ (even in the undirected case), and we devise approximation algorithms for various special cases. The fixed charge network design problem \textsc{Cap-USPR}, where the task is to find a minimum cost subgraph of $D$ whose fixed arc capacities admit an USPR of the commodities, is shown to be $\mathcal{NPO}$-complete. All three problems are of great practical interest in the planning of telecommunication networks that are based on shortest path routing protocols. Our results indicate that they are harder than the corresponding unsplittable flow or shortest multi-path routing problems. 2006 urn:nbn:de:0297-zib-8968 ZIB Allgemein OPUS4-1019 Dissertation Bley, Andreas Routing and Capacity Optimization for IP Networks This thesis is concerned with dimensioning and routing optimization problems for communication networks that employ a shortest path routing protocol such as OSPF, IS-IS, or RIP. These protocols are widely used in the Internet. With these routing protocols, all end-to-end data streams are routed along shortest paths with respect to a metric of link lengths. The network administrator can configure the routing only by modifying this metric. In this thesis we consider the unsplittable shortest path routing variant, where each communication demand must be sent unsplit through the network. This requires that all shortest paths are uniquely determined. The major difficulties in planning such networks are that the routing can be controlled only indirectly via the routing metric and that all routing paths depend on the same routing metric. This leads to rather complicated and subtle interdependencies among the paths that comprise a valid routing. In contrast to most other routing schemes, the paths for different communication demands cannot be configured independent of each other. Part I of the thesis is dedicated to the relation between path sets and routing metrics and to the combinatorial properties of those path sets that comprise a valid unsplittable shortest path routing. Besides reviewing known approaches to find a compatible metric for a given path set (or to prove that none exists) and discussing some properties of valid path sets, we show that the problem of finding a compatible metric with integer lengths as small as possible and the problem of finding a smallest possible conflict in the given path set are both NP-hard to approximate within a constant factor. In Part II of the thesis we discuss the relation between unsplittable shortest path routing and several other routing schemes and we analyze the computational complexity of three basic unsplittable shortest path routing problems. We show that the lowest congestion that can be obtained with unsplittable shortest path routing may significantly exceed that achievable with other routing paradigms and we prove several non-approximability results for unsplittable shortest path routing problems that are stronger than those for the corresponding unsplittable flow problems. In addition, we derive various polynomial time approximation algorithms for general and special cases of these problems. In Part III of the thesis we finally develop an integer linear programming approach to solve these and more realistic unsplittable shortest path routing problems to optimality. We present alternative formulations for these problems, discuss their strength and computational complexity, and show how to derive strong valid inequalities. Eventually, we describe our implementation of this solution approach and report on the numerical results obtained for real-world problems that came up in the planning the German National Research and Education Networks G-WiN and X-WiN and for several benchmark instances. 2007 978-3-86727-281-0 urn:nbn:de:kobv:83-opus-15530 Mathematical Optimization OPUS4-363 misc Bley, Andreas On the Complexity of Vertex-Disjoint Length-Restricted Path Problems Let $G=(V,E)$ be a simple graph and $s$ and $t$ be two distinct vertices of $G$. A path in $G$ is called $\ell$-bounded for some $\ell\in\mathbb{N}$, if it does not contain more than $\ell$ edges. We study the computational complexity of approximating the optimum value for two optimization problems of finding sets of vertex-disjoint $\ell$-bounded $s,t$-paths in $G$. First, we show that computing the maximum number of vertex-disjoint $\ell$-bounded $s,t$-paths is $\mathcal{AP\kern-1pt X}$--complete for any fixed length bound $\ell\geq 5$. Second, for a given number $k\in\mathbb{N}$, $1\leq k \leq |V|-1$, and non-negative weights on the edges of $G$, the problem of finding $k$ vertex-disjoint $\ell$-bounded $s,t$-paths with minimal total weight is proven to be $\mathcal{NPO}$--complete for any length bound $\ell\geq 5$. Furthermore, we show that, even if $G$ is complete, it is $\mathcal{NP}$--complete to approximate the optimal solution value of this problem within a factor of $2^{\langle\phi\rangle^\epsilon}$ for any constant $0<\epsilon<1$, where $\langle\phi\rangle$ denotes the encoding size of the given problem instance $\phi$. We prove that these results are tight in the sense that for lengths $\ell\leq 4$ both problems are polynomially solvable, assuming that the weights satisfy a generalized triangle inequality in the weighted problem. All results presented also hold for directed and non-simple graphs. For the analogous problems where the path length restriction is replaced by the condition that all paths must have length equal to $\ell$ or where vertex-disjointness is replaced by edge-disjointness we obtain similar results. 1998 urn:nbn:de:0297-zib-3639 ZIB Allgemein OPUS4-356 misc Bley, Andreas; Grötschel, Martin; Wessäly, Roland Design of Broadband Virtual Private Networks: Model and Heuristics for the B-WiN We investigate the problem of designing survivable broadband virtual private networks that employ the Open Shortest Path First (OSPF) routing protocol to route the packages. The capacities available for the links of the network are a minimal capacity plus multiples of a unit capacity. Given the directed communication demands between all pairs of nodes, we wish to select the capacities in a such way, that even in case of a single node or a single link failure a specified percentage of each demand can be satisfied and the costs for these capacities are minimal. We present a mixed--integer linear programming formulation of this problem and several heuristics for its solution. Furthermore, we report on computational results with real-world data. 1998 urn:nbn:de:0297-zib-3565 ZIB Allgemein OPUS4-582 misc Bienstock, Daniel; Bley, Andreas Capacitated Network Design with Multicast Commodities This paper addresses the problem of designing a minimum cost network whose capacities are sufficiently large to allow a feasible routing of a given set of multicast commodities. A multicast commodity consists of a set of two or mo re terminals that need to be connected by a so called broadcast tree, which consumes on all of its edges a capacity as large as the demand value associated with that commodity. We model the network design problem with multicast commodities as the problem of packing capacitated Steiner trees in a graph. In the first part of the paper we present three mixed-integer programming formulations for this problem. The first natural formulation uses only one integer capacity variable for each edge and and one binary tree variable for each commodity-edge pair. Applying well-known techniques from the Steiner tree problem, we then develop a stronger directed and a multicommodity flow based mixed-integer programming formulation. In the second part of the paper we study the associated polyhedra and derive valid and even facet defining inequalities for the natural formulation. Finally, we describe separation algorithms for these inequalities and present computational results that demonstrate the strength of our extended formulations. 2000 urn:nbn:de:0297-zib-5823 ZIB Allgemein OPUS4-1032 misc Bley, Andreas Routing and Capacity Optimization for IP networks This article describes the main concepts and techniques that have been developed during the last year at ZIB to solve dimensioning and routing optimization problems for IP networks. We discuss the problem of deciding if a given path set corresponds to an unsplittable shortest path routing, the fundamental properties of such path sets, and the computational complexity of some basic network planning problems for this routing type. Then we describe an integer-linear programming approach to solve such problems in practice. This approach has been used successfully in the planning of the German national education and research network for several years. 2007 urn:nbn:de:0297-zib-10323 Mathematical Optimization OPUS4-3135 Konferenzveröffentlichung Bley, Andreas; Grötschel, Martin; Wessäly, Roland Dean, Nathaniel; Hsu, D.; Ravi, R. Design of broadband virtual private networks: Model and Heuristics for the B-WiN Providence, RI American Mathematical Society 2000 15 Robust communication networks: Interconnection and survivability. DIMACS workshop, Princeton, NJ, USA, 1998 at Rutgers University 53 1 16 Mathematical Optimization OPUS4-3301 Konferenzveröffentlichung Bley, Andreas; Menne, Ulrich; Klähne, Roman; Raack, Christian; Wessäly, Roland Multi-layer network design - A model-based optimization approach Berlin, Germany Polish-German Teletraffic Symposium 2008 9 Proceedings of the PGTS 2008, Berlin, Germany 107 116 Mathematical Optimization OPUS4-4265 misc Bley, Andreas; D'Andreagiovanni, Fabio; Karch, Daniel Scheduling technology migration in WDM Networks The rapid technological evolution of telecommunication networks demands service providers to regularly update their technology, with the aim of remaining competitive in the marketplace. However, upgrading the technology in a network is not a trivial task. New hardware components need to be installed in the network and during the installation network connectivity may be temporarily compromised. The Wavelength Division Multiplexing (WDM) technology, whose upgrade is considered in here, shares fiber links among several optical connections and tearing down a single link may disrupt several optical connections at once. When the upgrades involve large parts of a network, typically not all links can be upgraded in parallel, which may lead to an unavoidable longer disruption of some connections. A bad scheduling of the overall endeavor, however, can dramatically increase the disconnection time of parts of the networks, causing extended service disruption. In this contribution, we study the problem of finding a schedule of the fiber link upgrades that minimizes the total service disruption time. To the best of our knowledge, this problem has not yet been formalized and investigated. The aim of our work is to close this gap by presenting a mathematical optimization model for the problem and an innovative solution algorithm that tackles the intrinsic difficulties of the problem. Computational experience on realistic instances completes our study. Our original investigations have been driven by real needs of DFN, operator of the German National Research and Education Network and our partner in the BMBF research project ROBUKOM (http://www.robukom.de/). 2013 urn:nbn:de:0297-zib-42654 Mathematical Optimization OPUS4-4760 Konferenzveröffentlichung Bley, Andreas; Gleixner, Ambros; Koch, Thorsten; Vigerske, Stefan Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling In this paper we investigate the performance of several out-of-the box solvers for mixed-integer quadratically constrained programmes (MIQCPs) on an open pit mine production scheduling problem with mixing constraints. We compare the solvers BARON, Couenne, SBB, and SCIP to a problem-specific algorithm on two different MIQCP formulations. The computational results presented show that general-purpose solvers with no particular knowledge of problem structure are able to nearly match the performance of a hand-crafted algorithm. 2012 14 Modeling, Simulation and Optimization of Complex Processes. Proceedings of the Fourth International Conference on High Performance Scientific Computing, March 2-6, 2009, Hanoi, Vietnam 25 39 10.1007/978-3-642-25707-0_3 Mathematical Optimization OPUS4-4763 Konferenzveröffentlichung Bley, Andreas On the Hardness of Finding Small Shortest Path Routing Conflicts Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing paths forms a valid routing and, if this is not the case, to find a small subset of the given paths that cannot be shortest paths simultaneously for any routing lengths. In this paper we show that it is NP-hard to approximate the size of the smallest shortest path conflict by a factor less than 7/6. 2009 Proceedings of 4th International Network Optimization Conference (INOC2009) Mathematical Optimization OPUS4-4805 Konferenzveröffentlichung Bley, Andreas; D'Andreagiovanni, Fabio; Karch, Daniel Scheduling technology migration in WDM Networks 2013 4 Photonic Networks, 14. 2013 ITG Symposium. Proceedings 1 5 Mathematical Optimization OPUS4-4808 Konferenzveröffentlichung Bley, Andreas; D'Andreagiovanni, Fabio; Karch, Daniel WDM Fiber Replacement Scheduling 2013 7 Proceedings of INOC 2013 41 189 196 10.1016/j.endm.2013.05.092 Mathematical Optimization OPUS4-3261 Konferenzveröffentlichung Bley, Andreas; Koch, Thorsten Integer programming approaches to access and backbone IP-network planning Springer 2008 23 Modeling, Simulation and Optimization of Complex Processes, Proceedings of the 3rd International Conference on High Performance Scientific Computing, March 6-10, Hanoi, Vietnam 87 110 Mathematical Optimization OPUS4-3241 Wissenschaftlicher Artikel Bley, Andreas; Koch, Thorsten Optimierung des G-WiN 2000 2 DFN-Mitteilungen 54 13 15 Mathematical Optimization OPUS4-3247 Konferenzveröffentlichung Bley, Andreas; Koch, Thorsten; Wessäly, Roland Kaindl, H. Large-Scale hierarchical networks: How to compute an optimal architecture? Berlin VDE Verlag 2004 5 Networks 2004 3-8007-2840-0 429 434 OPUS4-5268 Konferenzveröffentlichung Matuschke, Jannik; Bley, Andreas; Müller, Benjamin Bodlaender, Hans L.; Italiano, Giuseppe F. Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections We consider a generalization of the uncapacitated facility location problem that occurs in planning of optical access networks in telecommunications. Clients are connected to open facilities via depth-bounded trees. The total demand of clients served by a tree must not exceed a given tree capacity. We investigate a framework for combining facility location algorithms with a tree-based clustering approach and derive approximation algorithms for several variants of the problem, using techniques for approximating shallow-light Steiner trees via layer graphs, simultaneous approximation of shortest paths and minimum spanning trees, and greedy coverings. Springer 2013 11 Algorithms -- ESA 2013 707 718 10.1007/978-3-642-40450-4_60 Mathematical Optimization