TY - CHAP A1 - Skibina, Julia A1 - Bock, Martin A1 - Fischer, Dorit A1 - Grunwald, Rüdiger A1 - Steinmeyer, Günter A1 - Wedell, Reiner A1 - Bretschneider, Mario A1 - Burger, Sven A1 - Beloglazov, Valentin T1 - 10-fs fiber based pulse delivery T2 - Conference on Lasers, Applications, and Technologies (LAT) Y1 - 2013 SP - LWF5 ER - TY - JOUR A1 - Heinze, Rieke A1 - Dipankar, Anurag A1 - Henken, Cintia Carbajal A1 - Moseley, Christopher A1 - Sourdeval, Odran A1 - Trömel, Silke A1 - Xie, Xinxin A1 - Adamidis, Panos A1 - Ament, Felix A1 - Baars, Holger A1 - Barthlott, Christian A1 - Behrendt, Andreas A1 - Blahak, Ulrich A1 - Bley, Sebastian A1 - Brdar, Slavko A1 - Brueck, Matthias A1 - Crewell, Susanne A1 - Deneke, Hartwig A1 - Di Girolamo, Paolo A1 - Evaristo, Raquel A1 - Fischer, Jürgen A1 - Frank, Christopher A1 - Friederichs, Petra A1 - Göcke, Tobias A1 - Gorges, Ksenia A1 - Hande, Luke A1 - Hanke, Moritz A1 - Hansen, Akio A1 - Hege, Hans-Christian A1 - Hose, Corinna A1 - Jahns, Thomas A1 - Kalthoff, Norbert A1 - Klocke, Daniel A1 - Kneifel, Stefan A1 - Knippertz, Peter A1 - Kuhn, Alexander A1 - van Laar, Thriza A1 - Macke, Andreas A1 - Maurer, Vera A1 - Mayer, Bernhard A1 - Meyer, Catrin I. A1 - Muppa, Shravan K. A1 - Neggers, Roeland A. J. A1 - Orlandi, Emiliano A1 - Pantillon, Florian A1 - Pospichal, Bernhard A1 - Röber, Niklas A1 - Scheck, Leonhard A1 - Seifert, Axel A1 - Seifert, Patric A1 - Senf, Fabian A1 - Siligam, Pavan A1 - Simmer, Clemens A1 - Steinke, Sandra A1 - Stevens, Bjorn A1 - Wapler, Kathrin A1 - Weniger, Michael A1 - Wulfmeyer, Volker A1 - Zängl, Günther A1 - Zhang, Dan A1 - Quaas, Johannes T1 - Large-eddy simulations over Germany using ICON: a comprehensive evaluation JF - Quarterly Journal of the Royal Meteorological Society N2 - 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. Y1 - 2017 U6 - https://doi.org/10.1002/qj.2947 VL - 143 IS - 702 SP - 69 EP - 100 ER - TY - GEN A1 - Fischer, Lisa A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - Lossy data compression reduces communication time in hybrid time-parallel integrators N2 - Parallel in time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel in time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet no sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups. T3 - ZIB-Report - 17-25 KW - parallel-in-time integration KW - hybrid parareal KW - convergence KW - lossy compression KW - MPI Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-63961 SN - 1438-0064 ER - TY - JOUR A1 - Fischer, Lisa A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - Lossy data compression reduces communication time in hybrid time-parallel integrators JF - Comput. Vis. Sci. N2 - Parallel in time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel in time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet no sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups. Y1 - 2018 U6 - https://doi.org/10.1007/s00791-018-0293-2 VL - 19 IS - 1 SP - 19 EP - 30 ER - TY - THES A1 - Fischer, Lisa T1 - On the convergence of inexact time parallel time integration Y1 - 2017 ER - TY - THES A1 - Fischer, Jens V. T1 - A Gossiping Framework for Scalaris Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-50685 ER - TY - GEN A1 - Fischer, Alexander A1 - Schütte, Christof A1 - Deuflhard, Peter A1 - Cordes, Frank T1 - Hierarchical Uncoupling-Coupling of Metastable Conformations N2 - Uncoupling-coupling Monte Carlo (UCMC) combines uncoupling techniques for finite Markov chains with Markov chain Monte Carlo methodology. UCMC aims at avoiding the typical metastable or trapping behavior of Monte Carlo techniques. From the viewpoint of Monte Carlo, a slowly converging long-time Markov chain is replaced by a limited number of rapidly mixing short-time ones. Therefore, the state space of the chain has to be hierarchically decomposed into its metastable conformations. This is done by means of combining the technique of conformation analysis as recently introduced by the authors, and appropriate annealing strategies. We present a detailed examination of the uncoupling-coupling procedure which uncovers its theoretical background, and illustrates the hierarchical algorithmic approach. Furthermore, application of the UCMC algorithm to the $n$-pentane molecule allows us to discuss the effect of its crucial steps in a typical molecular scenario. T3 - ZIB-Report - 01-03 KW - almost invariant sets KW - bridge sampling KW - metastability KW - hierarchical annealing KW - hybrid Monte Carlo KW - $n$-pentane molecule KW - ratio of normalizing co Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6296 ER - TY - JOUR A1 - Garcia Santiago, Xavier A1 - Hammerschmidt, Martin A1 - Sachs, Johannes A1 - Burger, Sven A1 - Kwon, Hyunah A1 - Knöller, Marvin A1 - Arens, Tilo A1 - Fischer, Peer A1 - Fernandez-Corbaton, Ivan A1 - Rockstuhl, Carsten T1 - Toward maximally electromagnetically chiral scatterers at optical frequencies JF - ACS Photonics Y1 - 2022 U6 - https://doi.org/10.1021/acsphotonics.1c01887 VL - 9 SP - 1954 ER - TY - JOUR A1 - Gorgulla, Christoph A1 - Çınaroğlu, Süleyman A1 - Fischer, Patrick D. A1 - Fackeldey, Konstantin A1 - Wagner, Gerhard A1 - Arthanari, Haribabu T1 - VirtualFlow Ants—Ultra-Large Virtual Screenings with Artificial Intelligence Driven Docking Algorithm Based on Ant Colony Optimization JF - Special Issue Artificial Intelligence & Deep Learning Approaches for Structural Bioinformatics N2 - The docking program PLANTS, which is based on ant colony optimization (ACO) algorithm, has many advanced features for molecular docking. Among them are multiple scoring functions, the possibility to model explicit displaceable water molecules, and the inclusion of experimental constraints. Here, we add support of PLANTS to VirtualFlow (VirtualFlow Ants), which adds a valuable method for primary virtual screenings and rescoring procedures. Furthermore, we have added support of ligand libraries in the MOL2 format, as well as on the fly conversion of ligand libraries which are in the PDBQT format to the MOL2 format to endow VirtualFlow Ants with an increased flexibility regarding the ligand libraries. The on the fly conversion is carried out with Open Babel and the program SPORES. We applied VirtualFlow Ants to a test system involving KEAP1 on the Google Cloud up to 128,000 CPUs, and the observed scaling behavior is approximately linear. Furthermore, we have adjusted several central docking parameters of PLANTS (such as the speed parameter or the number of ants) and screened 10 million compounds for each of the 10 resulting docking scenarios. We analyzed their docking scores and average docking times, which are key factors in virtual screenings. The possibility of carrying out ultra-large virtual screening with PLANTS via VirtualFlow Ants opens new avenues in computational drug discovery. Y1 - 2021 U6 - https://doi.org/https://doi.org/10.3390/ijms22115807 VL - 22 IS - 11 SP - 5807 ER - TY - JOUR A1 - Schimunek, Johannes A1 - Seidl, Philipp A1 - Elez, Katarina A1 - Hempel, Tim A1 - Le, Tuan A1 - Noé, Frank A1 - Olsson, Simon A1 - Raich, Lluís A1 - Winter, Robin A1 - Gokcan, Hatice A1 - Gusev, Filipp A1 - Gutkin, Evgeny M. A1 - Isayev, Olexandr A1 - Kurnikova, Maria G. A1 - Narangoda, Chamali H. A1 - Zubatyuk, Roman A1 - Bosko, Ivan P. A1 - Furs, Konstantin V. A1 - Karpenko, Anna D. A1 - Kornoushenko, Yury V. A1 - Shuldau, Mikita A1 - Yushkevich, Artsemi A1 - Benabderrahmane, Mohammed B. A1 - Bousquet-Melou, Patrick A1 - Bureau, Ronan A1 - Charton, Beatrice A1 - Cirou, Bertrand C. A1 - Gil, Gérard A1 - Allen, William J. A1 - Sirimulla, Suman A1 - Watowich, Stanley A1 - Antonopoulos, Nick A1 - Epitropakis, Nikolaos A1 - Krasoulis, Agamemnon A1 - Itsikalis, Vassilis A1 - Theodorakis, Stavros A1 - Kozlovskii, Igor A1 - Maliutin, Anton A1 - Medvedev, Alexander A1 - Popov, Petr A1 - Zaretckii, Mark A1 - Eghbal-Zadeh, Hamid A1 - Halmich, Christina A1 - Hochreiter, Sepp A1 - Mayr, Andreas A1 - Ruch, Peter A1 - Widrich, Michael A1 - Berenger, Francois A1 - Kumar, Ashutosh A1 - Yamanishi, Yoshihiro A1 - Zhang, Kam Y. J. A1 - Bengio, Emmanuel A1 - Bengio, Yoshua A1 - Jain, Moksh J. A1 - Korablyov, Maksym A1 - Liu, Cheng-Hao A1 - Marcou, Gilles A1 - Glaab, Enrico A1 - Barnsley, Kelly A1 - Iyengar, Suhasini M. A1 - Ondrechen, Mary Jo A1 - Haupt, V. Joachim A1 - Kaiser, Florian A1 - Schroeder, Michael A1 - Pugliese, Luisa A1 - Albani, Simone A1 - Athanasiou, Christina A1 - Beccari, Andrea A1 - Carloni, Paolo A1 - D’Arrigo, Giulia A1 - Gianquinto, Eleonora A1 - Goßen, Jonas A1 - Hanke, Anton A1 - Joseph, Benjamin P. A1 - Kokh, Daria B. A1 - Kovachka, Sandra A1 - Manelfi, Candida A1 - Mukherjee, Goutam A1 - Muñiz-Chicharro, Abraham A1 - Musiani, Francesco A1 - Nunes-Alves, Ariane A1 - Paiardi, Giulia A1 - Rossetti, Giulia A1 - Sadiq, S. Kashif A1 - Spyrakis, Francesca A1 - Talarico, Carmine A1 - Tsengenes, Alexandros A1 - Wade, Rebecca C. A1 - Copeland, Conner A1 - Gaiser, Jeremiah A1 - Olson, Daniel R. A1 - Roy, Amitava A1 - Venkatraman, Vishwesh A1 - Wheeler, Travis J. A1 - Arthanari, Haribabu A1 - Blaschitz, Klara A1 - Cespugli, Marco A1 - Durmaz, Vedat A1 - Fackeldey, Konstantin A1 - Fischer, Patrick D. A1 - Gorgulla, Christoph A1 - Gruber, Christian A1 - Gruber, Karl A1 - Hetmann, Michael A1 - Kinney, Jamie E. A1 - Padmanabha Das, Krishna M. A1 - Pandita, Shreya A1 - Singh, Amit A1 - Steinkellner, Georg A1 - Tesseyre, Guilhem A1 - Wagner, Gerhard A1 - Wang, Zi-Fu A1 - Yust, Ryan J. A1 - Druzhilovskiy, Dmitry S. A1 - Filimonov, Dmitry A. A1 - Pogodin, Pavel V. A1 - Poroikov, Vladimir A1 - Rudik, Anastassia V. A1 - Stolbov, Leonid A. A1 - Veselovsky, Alexander V. A1 - De Rosa, Maria A1 - De Simone, Giada A1 - Gulotta, Maria R. A1 - Lombino, Jessica A1 - Mekni, Nedra A1 - Perricone, Ugo A1 - Casini, Arturo A1 - Embree, Amanda A1 - Gordon, D. Benjamin A1 - Lei, David A1 - Pratt, Katelin A1 - Voigt, Christopher A. A1 - Chen, Kuang-Yu A1 - Jacob, Yves A1 - Krischuns, Tim A1 - Lafaye, Pierre A1 - Zettor, Agnès A1 - Rodríguez, M. Luis A1 - White, Kris M. A1 - Fearon, Daren A1 - Von Delft, Frank A1 - Walsh, Martin A. A1 - Horvath, Dragos A1 - Brooks III, Charles L. A1 - Falsafi, Babak A1 - Ford, Bryan A1 - García-Sastre, Adolfo A1 - Yup Lee, Sang A1 - Naffakh, Nadia A1 - Varnek, Alexandre A1 - Klambauer, Günter A1 - Hermans, Thomas M. T1 - A community effort in SARS-CoV-2 drug discovery JF - Molecular Informatics KW - COVID-19 KW - drug discovery KW - machine learning KW - SARS-CoV-2 Y1 - 2023 U6 - https://doi.org/https://doi.org/10.1002/minf.202300262 VL - 43 IS - 1 SP - e202300262 ER - TY - JOUR A1 - Fischer, Kristina A1 - Gerber, Anja A1 - Koprucki, Thomas A1 - Noback, Andres A1 - Reidelbach, Marco A1 - Schrade, Torsten A1 - Thiery, Florian T1 - Windows on Data: Federating Research Data with FAIR Digital Objects and Linked Open Data JF - 2nd Conference on Research Data Infrastructure (CoRDI) Y1 - 2025 U6 - https://doi.org/10.5281/zenodo.16736222 ER - TY - CHAP A1 - Gossing, Anne A1 - Beckert, Andreas A1 - Fischer, Christoph A1 - Klenert, Nicolas A1 - Natarajan, Vijay A1 - Pacey, George A1 - Vogt, Thorwin A1 - Rautenhaus, Marc A1 - Baum, Daniel T1 - A Ridge-based Approach for Extraction and Visualization of 3D Atmospheric Fronts T2 - 2024 IEEE Visualization and Visual Analytics (VIS) N2 - An atmospheric front is an imaginary surface that separates two distinct air masses and is commonly defined as the warm-air side of a frontal zone with high gradients of atmospheric temperature and humidity. These fronts are a widely used conceptual model in meteorology, which are often encountered in the literature as two-dimensional (2D) front lines on surface analysis charts. This paper presents a method for computing three-dimensional (3D) atmospheric fronts as surfaces that is capable of extracting continuous and well-confined features suitable for 3D visual analysis, spatio-temporal tracking, and statistical analyses. Recently developed contour-based methods for 3D front extraction rely on computing the third derivative of a moist potential temperature field. Additionally, they require the field to be smoothed to obtain continuous large-scale structures. This paper demonstrates the feasibility of an alternative method to front extraction using ridge surface computation. The proposed method requires only the sec- ond derivative of the input field and produces accurate structures even from unsmoothed data. An application of the ridge-based method to a data set corresponding to Cyclone Friederike demonstrates its benefits and utility towards visual analysis of the full 3D structure of fronts. Y1 - 2024 U6 - https://doi.org/10.1109/VIS55277.2024.00043 SP - 176 EP - 180 ER - TY - JOUR A1 - Ramos, Alejandro A1 - Fischer, Eric W. A1 - Saalfrank, Peter A1 - Kühn, Oliver T1 - Shaping the laser control landscape of a hydrogen transfer reaction by vibrational strong coupling. A direct optimal control approach JF - The Journal of Chemical Physics Y1 - 2024 ER - TY - JOUR A1 - Fischer-Holzhausen, Sophie A1 - Röblitz, Susanna T1 - Hormonal regulation of ovarian follicle growth in humans: Model-based exploration of cycle variability and parameter sensitivities JF - Journal of Theoretical Biology N2 - We present a modelling and simulation framework for the dynamics of ovarian follicles and key hormones along the hypothalamic-pituitary-gonadal axis throughout consecutive human menstrual cycles. All simulation results (hormone concentrations and ovarian follicle sizes) are in biological units and can easily be compared to clinical data. The model takes into account variability in follicles' response to stimulating hormones, which introduces variability between cycles. The growth of ovarian follicles in waves is an emergent property in our model simulations and further supports the hypothesis that follicular waves are also present in humans. We use Approximate Bayesian Computation and cluster analysis to construct a population of virtual subjects and to study parameter distributions and sensitivities. The model can be used to compare and optimize treatment protocols for ovarian hyperstimulation, thus potentially forming the integral part of a clinical decision support system in reproductive endocrinology. Y1 - 2022 U6 - https://doi.org/https://doi.org/10.1016/j.jtbi.2022.111150 ER - TY - JOUR A1 - Fischer-Holzhausen, Sophie A1 - Röblitz, Susanna T1 - Mathematical modelling of follicular growth and ovarian stimulation JF - Current Opinion in Endocrine and Metabolic Research Y1 - 2022 U6 - https://doi.org/https://doi.org/10.1016/j.coemr.2022.100385 ER - TY - GEN A1 - Maher, Stephen J. A1 - Fischer, Tobias A1 - Gally, Tristan A1 - Gamrath, Gerald A1 - Gleixner, Ambros A1 - Gottwald, Robert Lion A1 - Hendel, Gregor A1 - Koch, Thorsten A1 - Lübbecke, Marco A1 - Miltenberger, Matthias A1 - Müller, Benjamin A1 - Pfetsch, Marc A1 - Puchert, Christian A1 - Rehfeldt, Daniel A1 - Schenker, Sebastian A1 - Schwarz, Robert A1 - Serrano, Felipe A1 - Shinano, Yuji A1 - Weninger, Dieter A1 - Witt, Jonas T. A1 - Witzig, Jakob T1 - The SCIP Optimization Suite 4.0 N2 - The SCIP Optimization Suite is a powerful collection of optimization software that consists of the branch-cut-and-price framework and mixed-integer programming solver SCIP, the linear programming solver SoPlex, the modeling language Zimpl, the parallelization framework UG, and the generic branch-cut-and-price solver GCG. Additionally, it features the extensions SCIP-Jack for solving Steiner tree problems, PolySCIP for solving multi-objective problems, and SCIP-SDP for solving mixed-integer semidefinite programs. The SCIP Optimization Suite has been continuously developed and has now reached version 4.0. The goal of this report is to present the recent changes to the collection. We not only describe the theoretical basis, but focus on implementation aspects and their computational consequences. T3 - ZIB-Report - 17-12 Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-62170 SN - 1438-0064 ER - TY - GEN A1 - Gamrath, Gerald A1 - Fischer, Tobias A1 - Gally, Tristan A1 - Gleixner, Ambros A1 - Hendel, Gregor A1 - Koch, Thorsten A1 - Maher, Stephen J. A1 - Miltenberger, Matthias A1 - Müller, Benjamin A1 - Pfetsch, Marc A1 - Puchert, Christian A1 - Rehfeldt, Daniel A1 - Schenker, Sebastian A1 - Schwarz, Robert A1 - Serrano, Felipe A1 - Shinano, Yuji A1 - Vigerske, Stefan A1 - Weninger, Dieter A1 - Winkler, Michael A1 - Witt, Jonas T. A1 - Witzig, Jakob T1 - The SCIP Optimization Suite 3.2 N2 - The SCIP Optimization Suite is a software toolbox for generating and solving various classes of mathematical optimization problems. Its major components are the modeling language ZIMPL, the linear programming solver SoPlex, the constraint integer programming framework and mixed-integer linear and nonlinear programming solver SCIP, the UG framework for parallelization of branch-and-bound-based solvers, and the generic branch-cut-and-price solver GCG. It has been used in many applications from both academia and industry and is one of the leading non-commercial solvers. This paper highlights the new features of version 3.2 of the SCIP Optimization Suite. Version 3.2 was released in July 2015. This release comes with new presolving steps, primal heuristics, and branching rules within SCIP. In addition, version 3.2 includes a reoptimization feature and improved handling of quadratic constraints and special ordered sets. SoPlex can now solve LPs exactly over the rational number and performance improvements have been achieved by exploiting sparsity in more situations. UG has been tested successfully on 80,000 cores. A major new feature of UG is the functionality to parallelize a customized SCIP solver. GCG has been enhanced with a new separator, new primal heuristics, and improved column management. Finally, new and improved extensions of SCIP are presented, namely solvers for multi-criteria optimization, Steiner tree problems, and mixed-integer semidefinite programs. T3 - ZIB-Report - 15-60 KW - mixed-integer linear and nonlinear programming KW - MIP solver KW - MINLP solver KW - linear programming KW - LP solver KW - simplex method KW - modeling KW - parallel branch-and-bound KW - branch-cut-and-price framework KW - generic column generation KW - Steiner tree solver KW - multi-criteria optimization KW - mixed-integer semidefinite programming Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-57675 SN - 1438-0064 ER - TY - CHAP A1 - Fischer, Frank A1 - Schlechte, Thomas ED - D'Angelo, Gianlorenzo ED - Dollevoet, Twan T1 - Strong Relaxations for the Train Timetabling Problem using Connected Configurations T2 - 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017) N2 - The task of the train timetabling problem or track allocation problem is to find conflict free schedules for a set of trains with predefined routes in a railway network. Especially for non-periodic instances models based on time expanded networks are often used. Unfortunately, the linear programming relaxation of these models is often extremely weak because these models do not describe combinatorial relations like overtaking possibilities very well. In this paper we extend the model by so called connected configuration subproblems. These subproblems perfectly describe feasible schedules of a small subset of trains (2-3) on consecutive track segments. In a Lagrangian relaxation approach we solve several of these subproblems together in order to produce solutions which consist of combinatorially compatible schedules along the track segments. The computational results on a mostly single track corridor taken from the INFORMS RAS Problem Solving Competition 2012 data indicate that our new solution approach is rather strong. Indeed, for this instance the solution of the Lagrangian relaxation is already integral. Y1 - 2017 SN - 978-3-95977-042-2 U6 - https://doi.org/10.4230/OASIcs.ATMOS.2017.11 VL - 59 ER -