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-6588 Wissenschaftlicher Artikel Schmidt, Martin; Assmann, Denis; Burlacu, Robert; Humpola, Jesco; Joormann, Imke; Kanelakis, Nikolaos; Koch, Thorsten; Oucherif, Djamal; Pfetsch, Marc; Schewe, Lars; Schwarz, Robert; Sirvent, Matthias GasLib - A Library of Gas Network Instances 2017 Data 2 4 10.3390/data2040040 Mathematical Optimization OPUS4-6217 misc Maher, Stephen J.; Fischer, Tobias; Gally, Tristan; Gamrath, Gerald; Gleixner, Ambros; Gottwald, Robert Lion; Hendel, Gregor; Koch, Thorsten; Lübbecke, Marco; Miltenberger, Matthias; Müller, Benjamin; Pfetsch, Marc; Puchert, Christian; Rehfeldt, Daniel; Schenker, Sebastian; Schwarz, Robert; Serrano, Felipe; Shinano, Yuji; Weninger, Dieter; Witt, Jonas T.; Witzig, Jakob The SCIP Optimization Suite 4.0 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. 2017 urn:nbn:de:0297-zib-62170 Mathematical Optimization OPUS4-1782 misc Fügenschuh, Armin; Geißler, Björn; Gollmer, Ralf; Hayn, Christine; Henrion, Rene; Hiller, Benjamin; Humpola, Jesco; Koch, Thorsten; Lehmann, Thomas; Martin, Alexander; Mirkov, Radoslava; Morsi, Antonio; Römisch, Werner; Rövekamp, Jessica; Schewe, Lars; Schmidt, Martin; Schultz, Rüdiger; Schwarz, Robert; Schweiger, Jonas; Stangl, Claudia; Steinbach, Marc; Willert, Bernhard Mathematical Optimization for Challenging Network Planning Problems in Unbundled Liberalized Gas Markets The recently imposed new gas market liberalization rules in Germany lead to a change of business of gas network operators. While previously network operator and gas vendor where united, they were forced to split up into independent companies. The network has to be open to any other gas trader at the same conditions, and free network capacities have to be identified and publicly offered in a non-discriminatory way. We show that these new paradigms lead to new and challenging mathematical optimization problems. In order to solve them and to provide meaningful results for practice, all aspects of the underlying problems, such as combinatorics, stochasticity, uncertainty, and nonlinearity, have to be addressed. With such special-tailored solvers, free network capacities and topological network extensions can, for instance, be determined. 2013 urn:nbn:de:0297-zib-17821 10.1007/s12667-013-0099-8 Mathematical Optimization OPUS4-1234 misc Fügenschuh, Armin; Hiller, Benjamin; Humpola, Jesco; Koch, Thorsten; Lehmann, Thomas; Schwarz, Robert; Schweiger, Jonas; Szabó, Jácint Gas Network Topology Optimization for Upcoming Market Requirements Gas distribution networks are complex structures that consist of passive pipes, and active, controllable elements such as valves and compressors. Controlling such network means to find a suitable setting for all active components such that a nominated amount of gas can be transmitted from entries to exits through the network, without violating physical or operational constraints. The control of a large-scale gas network is a challenging task from a practical point of view. In most companies the actual controlling process is supported by means of computer software that is able to simulate the flow of the gas. However, the active settings have to be set manually within such simulation software. The solution quality thus depends on the experience of a human planner. When the gas network is insufficient for the transport then topology extensions come into play. Here a set of new pipes or active elements is determined such that the extended network admits a feasible control again. The question again is how to select these extensions and where to place them such that the total extension costs are minimal. Industrial practice is again to use the same simulation software, determine extensions by experience, add them to the virtual network, and then try to find a feasible control of the active elements. The validity of this approach now depends even more on the human planner. Another weakness of this manual simulation-based approach is that it cannot establish infeasibility of a certain gas nomination, unless all settings of the active elements are tried. Moreover, it is impossible to find a cost-optimal network extension in this way. In order to overcome these shortcomings of the manual planning approach we present a new approach, rigorously based on mathematical optimization. Hereto we describe a model for finding feasible controls and then extend this model such that topology extensions can additionally and simultaneously be covered. Numerical results for real-world instances are presented and discussed. 2011 urn:nbn:de:0297-zib-12348 10.1109/EEM.2011.5953035 Mathematical Optimization OPUS4-4718 Wissenschaftlicher Artikel Pfetsch, Marc; Fügenschuh, Armin; Geißler, Björn; Geißler, Nina; Gollmer, Ralf; Hiller, Benjamin; Humpola, Jesco; Koch, Thorsten; Lehmann, Thomas; Martin, Alexander; Morsi, Antonio; Rövekamp, Jessica; Schewe, Lars; Schmidt, Martin; Schultz, Rüdiger; Schwarz, Robert; Schweiger, Jonas; Stangl, Claudia; Steinbach, Marc; Vigerske, Stefan; Willert, Bernhard Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints. We describe a two-stage approach to solve the resulting complex and numerically difficult feasibility problem. The first phase consists of four distinct algorithms applying linear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances that are significantly larger than networks that have appeared in the mathematical programming literature before. Taylor & Francis 2014 Optimization Methods and Software 10.1080/10556788.2014.888426 Mathematical Optimization OPUS4-4738 Wissenschaftlicher Artikel Fügenschuh, Armin; Geißler, Björn; Gollmer, Ralf; Hayn, Christine; Henrion, René; Hiller, Benjamin; Humpola, Jesco; Koch, Thorsten; Lehmann, Thomas; Martin, Alexander; Mirkov, Radoslava; Morsi, Antonio; Römisch, Werner; Rövekamp, Jessica; Schewe, Lars; Schmidt, Martin; Schultz, Rüdiger; Schwarz, Robert; Schweiger, Jonas; Stangl, Claudia; Steinbach, Marc; Willert, Bernhard Mathematical optimization for challenging network planning problems in unbundled liberalized gas markets The recently imposed new gas market liberalization rules in Germany lead to a change of business of gas network operators. While previously network operator and gas vendor were united, they were forced to split up into independent companies. The network has to be open to any other gas trader at the same conditions, and free network capacities have to be identified and publicly offered in a non-discriminatory way. We discuss how these changing paradigms lead to new and challenging mathematical optimization problems. This includes the validation of nominations, that asks for the decision if the network's capacity is sufficient to transport a specific amount of flow, the verification of booked capacities and the detection of available freely allocable capacities, and the topological extension of the network with new pipelines or compressors in order to increase its capacity. In order to solve each of these problems and to provide meaningful results for the practice, a mixture of different mathematical aspects have to be addressed, such as combinatorics, stochasticity, uncertainty, and nonlinearity. Currently, no numerical solver is available that can deal with such blended problems out-of-the-box. The main goal of our research is to develop such a solver, that moreover is able to solve instances of realistic size. In this article, we describe the main ingredients of our prototypical software implementations. Berlin Springer Berlin Heidelberg 2013 24 Energy Systems 5 3 449 473 10.1007/s12667-013-0099-8 Mathematical Optimization OPUS4-5795 Wissenschaftlicher Artikel Humpola, Jesco; Joormann, Imke; Oucherif, Djamal; Pfetsch, Marc; Schewe, Lars; Schmidt, Martin; Schwarz, Robert GasLib - A Library of Gas Network Instances The development of mathematical simulation and optimization models and algorithms for solving gas transport problems is an active field of research. In order to test and compare these models and algorithms, gas network instances together with demand data are needed. The goal of GasLib is to provide a set of publicly available gas network instances that can be used by researchers in the field of gas transport. The advantages are that researchers save time by using these instances and that different models and algorithms can be compared on the same specified test sets. The library instances are encoded in an XML format. In this paper, we explain this format and present the instances that are available in the library. 2015 Optimization Online urn:nbn:de:0297-zib-57950 Mathematical Optimization OPUS4-4832 Konferenzveröffentlichung Fügenschuh, Armin; Hiller, Benjamin; Humpola, Jesco; Koch, Thorsten; Lehmann, Thomas; Schwarz, Robert; Schweiger, Jonas; Szabo, Jacint Gas Network Topology Optimization for Upcoming Market Requirements Gas distribution networks are complex structures that consist of passive pipes, and active, controllable elements such as valves and compressors. Controlling such network means to find a suitable setting for all active components such that a nominated amount of gas can be transmitted from entries to exits through the network, without violating physical or operational constraints. The control of a large-scale gas network is a challenging task from a practical point of view. In most companies the actual controlling process is supported by means of computer software that is able to simulate the flow of the gas. However, the active settings have to be set manually within such simulation software. The solution quality thus depends on the experience of a human planner. When the gas network is insufficient for the transport then topology extensions come into play. Here a set of new pipes or active elements is determined such that the extended network admits a feasible control again. The question again is how to select these extensions and where to place them such that the total extension costs are minimal. Industrial practice is again to use the same simulation software, determine extensions by experience, add them to the virtual network, and then try to find a feasible control of the active elements. The validity of this approach now depends even more on the human planner. Another weakness of this manual simulation-based approach is that it cannot establish infeasibility of a certain gas nomination, unless all settings of the active elements are tried. Moreover, it is impossible to find a cost-optimal network extension in this way. In order to overcome these shortcomings of the manual planning approach we present a new approach, rigorously based on mathematical optimization. Hereto we describe a model for finding feasible controls and then extend this model such that topology extensions can additionally and simultaneously be covered. Numerical results for real-world instances are presented and discussed. 2011 5 International Conference on the European Energy Market (EEM) 346 351 10.1109/EEM.2011.5953035 Mathematical Optimization OPUS4-6719 Konferenzveröffentlichung Hoppmann, Kai; Schwarz, Robert Finding Maximum Minimum Cost Flows to Evaluate Gas Network Capacities In this article we consider the following problem arising in the context of scenario generation to evaluate the transport capacity of gas networks: In the Uncapacitated Maximum Minimum Cost Flow Problem (UMMCF) we are given a flow network where each arc has an associated nonnegative length and infinite capacity. Additionally, for each source and each sink a lower and an upper bound on its supply and demand are known, respectively. The goal is to find values for the supplies and demands respecting these bounds, such that the optimal value of the induced Minimum Cost Flow Problem is maximized, i.e., to determine a scenario with maximum transportmoment. In this article we propose two linear bilevel optimization models for UMMCF, introduce a greedy-style heuristic, and report on our first computational experiment. 2018 7 Operations Research Proceedings 2017 978-3-319-89919-0 339 346 10.1007/978-3-319-89920-6_46 Mathematical Optimization OPUS4-6151 misc Hennig, Kai; Schwarz, Robert Using Bilevel Optimization to find Severe Transport Situations in Gas Transmission Networks In the context of gas transmission in decoupled entry-exit systems, many approaches to determine the network capacity are based on the evaluation of realistic and severe transport situations. In this paper, we review the Reference Point Method, which is an algorithm used in practice to generate a set of scenarios using the so-called transport moment as a measure for severity. We introduce a new algorithm for finding severe transport situations that considers an actual routing of the flow through the network and is designed to handle issues arising from cyclic structures in a more dynamical manner. Further, in order to better approximate the physics of gas, an alternative, potential based flow formulation is proposed. The report concludes with a case study based on data from the benchmark library GasLib. 2016 urn:nbn:de:0297-zib-61519 Mathematical Optimization OPUS4-6156 misc Lenz, Ralf; Schwarz, Robert Optimal Looping of Pipelines in Gas Networks In this paper, we compare several approaches for the problem of gas network expansions using loops, that is, to build new pipelines in parallel to existing ones. We present different model formulations for the problem of continuous loop expansions as well as discrete loop expansions. We then analyze problem properties, such as the structure and convexity of the underlying feasible regions. The paper concludes with a computational study comparing the continuous and the discrete formulations. 2016 urn:nbn:de:0297-zib-61564 Mathematical Optimization OPUS4-3267 Konferenzveröffentlichung Martin, Alexander; Geißler, Björn; Heyn, Christine; Hiller, Benjamin; Humpola, Jesco; Koch, Thorsten; Lehmann, Thomas; Morsi, Antonio; Pfetsch, Marc; Schewe, Lars; Schmidt, Martin; Schultz, Rüdiger; Schwarz, Robert; Schweiger, Jonas; Steinbach, Marc; Willert, Bernhard Optimierung Technischer Kapazitäten in Gasnetzen VDI-Verlag, Düsseldorf 2011 9 Optimierung in der Energiewirtschaft 105 114 Mathematical Optimization OPUS4-5349 Teil eines Buches Hiller, Benjamin; Humpola, Jesco; Lehmann, Thomas; Lenz, Ralf; Morsi, Antonio; Pfetsch, Marc; Schewe, Lars; Schmidt, Martin; Schwarz, Robert; Schweiger, Jonas; Stangl, Claudia; Willert, Bernhard Computational results for validation of nominations The different approaches to solve the validation of nomination problem presented in the previous chapters are evaluated computationally in this chapter. Each approach is analyzed individually, as well as the complete solvers for these problems. We demonstrate that the presented approaches can successfully solve large-scale real-world instances. 2015 Evaluating Gas Network Capacities SIAM-MOS series on Optimization 9781611973686 Mathematical Optimization OPUS4-5345 Teil eines Buches Humpola, Jesco; Fügenschuh, Armin; Hiller, Benjamin; Koch, Thorsten; Lehmann, Thomas; Lenz, Ralf; Schwarz, Robert; Schweiger, Jonas The Specialized MINLP Approach We propose an approach to solve the validation of nominations problem using mixed-integer nonlinear programming (MINLP) methods. Our approach handles both the discrete settings and the nonlinear aspects of gas physics. Our main contribution is an innovative coupling of mixed-integer (linear) programming (MILP) methods with nonlinear programming (NLP) that exploits the special structure of a suitable approximation of gas physics, resulting in a global optimization method for this type of problem. 2015 Evaluating Gas Network Capacities SIAM-MOS series on Optimization 9781611973686 Mathematical Optimization OPUS4-7840 Wissenschaftlicher Artikel Serrano, Felipe; Schwarz, Robert; Gleixner, Ambros On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm Recently, Kronqvist et al. (J Global Optim 64(2):249-272, 2016) rediscovered the supporting hyperplane algorithm of Veinott (Oper Res 15(1):147-152, 1967) and demonstrated its computational benefits for solving convex mixed integer nonlinear programs. In this paper we derive the algorithm from a geometric point of view. This enables us to show that the supporting hyperplane algorithm is equivalent to Kelley's cutting plane algorithm (J Soc Ind Appl Math 8(4):703-712, 1960) applied to a particular reformulation of the problem. As a result, we extend the applicability of the supporting hyperplane algorithm to convex problems represented by a class of general, not necessarily convex nor differentiable, functions. 2020 18 Journal of Global Optimization 78 161 179 10.1007/s10898-020-00906-y Mathematical Optimization OPUS4-7325 misc Serrano, Felipe; Schwarz, Robert; Gleixner, Ambros On the Relation between the Extended Supporting Hyperplane Algorithm and Kelley's Cutting Plane Algorithm Recently, Kronqvist et al. (2016) rediscovered the supporting hyperplane algorithm of Veinott (1967) and demonstrated its computational benefits for solving convex mixed-integer nonlinear programs. In this paper we derive the algorithm from a geometric point of view. This enables us to show that the supporting hyperplane algorithm is equivalent to Kelley's cutting plane algorithm applied to a particular reformulation of the problem. As a result, we extend the applicability of the supporting hyperplane algorithm to convex problems represented by general, not necessarily convex, differentiable functions that satisfy a mild condition. 2019 urn:nbn:de:0297-zib-73253 Mathematical Optimization OPUS4-6743 misc Hiller, Benjamin; Koch, Thorsten; Schewe, Lars; Schwarz, Robert; Schweiger, Jonas A System to Evaluate Gas Network Capacities: Concepts and Implementation In 2005 the European Union liberalized the gas market with a disruptive change and decoupled trading of natural gas from its transport. The gas is now transported by independent so-called transmissions system operators or TSOs. The market model established by the European Union views the gas transmission network as a black box, providing shippers (gas traders and consumers) the opportunity to transport gas from any entry to any exit. TSOs are required to offer the maximum possible capacities at each entry and exit such that any resulting gas flow can be realized by the network. The revenue from selling these capacities more than one billion Euro in Germany alone, but overestimating the capacity might compromise the security of supply. Therefore, evaluating the available transport capacities is extremely important to the TSOs. This is a report on a large project in mathematical optimization, set out to develop a new toolset for evaluating gas network capacities. The goals and the challenges as they occurred in the project are described, as well as the developments and design decisions taken to meet the requirements. 2018 urn:nbn:de:0297-zib-67438 Mathematical Optimization OPUS4-6730 Wissenschaftlicher Artikel Hiller, Benjamin; Koch, Thorsten; Schewe, Lars; Schwarz, Robert; Schweiger, Jonas A System to Evaluate Gas Network Capacities: Concepts and Implementation In 2005 the European Union liberalized the gas market with a disruptive change and decoupled trading of natural gas from its transport. The gas is now trans- ported by independent so-called transmissions system operators or TSOs. The market model established by the European Union views the gas transmission network as a black box, providing shippers (gas traders and consumers) the opportunity to transport gas from any entry to any exit. TSOs are required to offer the maximum possible capacities at each entry and exit such that any resulting gas flow can be realized by the network. The revenue from selling these capacities more than one billion Euro in Germany alone, but overestimating the capacity might compromise the security of supply. Therefore, evaluating the available transport capacities is extremely important to the TSOs. This is a report on a large project in mathematical optimization, set out to develop a new toolset for evaluating gas network capacities. The goals and the challenges as they occurred in the project are described, as well as the developments and design decisions taken to meet the requirements. 2018 11 European Journal of Operational Research 270 3 797 808 Mathematical Optimization OPUS4-1653 misc Pfetsch, Marc; Fügenschuh, Armin; Geißler, Björn; Geißler, Nina; Gollmer, Ralf; Hiller, Benjamin; Humpola, Jesco; Koch, Thorsten; Lehmann, Thomas; Martin, Alexander; Morsi, Antonio; Rövekamp, Jessica; Schewe, Lars; Schmidt, Martin; Schultz, Rüdiger; Schwarz, Robert; Schweiger, Jonas; Stangl, Claudia; Steinbach, Marc; Vigerske, Stefan; Willert, Bernhard Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints. We describe a two-stage approach to solve the resulting complex and numerically difficult mixed-integer non-convex nonlinear feasibility problem. The first phase consists of four distinct algorithms facilitating mixed-integer linear, mixed-integer nonlinear, reduced nonlinear, and complementarity constrained methods to compute possible settings for the discrete decisions. The second phase employs a precise continuous nonlinear programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances whose size is significantly larger than networks that have appeared in the literature previously. 2012 urn:nbn:de:0297-zib-16531 10.1080/10556788.2014.888426 Mathematical Optimization OPUS4-6193 misc Hiller, Benjamin; Koch, Thorsten; Schewe, Lars; Schwarz, Robert; Schweiger, Jonas A System to Evaluate Gas Network Capacities: Concepts and Implementation Since 2005, the gas market in the European Union is liberalized and the trading of natural gas is decoupled from its transport. The transport is done by so-called transmissions system operators or TSOs. The market model established by the European Union views the gas transmission network as a black box, providing shippers (gas traders and consumers) the opportunity to transport gas from any entry to any exit. TSOs are required to offer maximum independent capacities at each entry and exit such that the resulting gas flows can be realized by the network without compromising security of supply. Therefore, evaluating the available transport capacities is extremely important to the TSOs. This paper gives an overview of the toolset for evaluating gas network capacities that has been developed within the ForNe project, a joint research project of seven research partners initiated by Open Grid Europe, Germany's biggest TSO. While most of the relevant mathematics is described in the book "Evaluating Gas Network Capacities", this article sketches the system as a whole, describes some developments that have taken place recently, and gives some details about the current implementation. 2017 urn:nbn:de:0297-zib-61931 Mathematical Optimization OPUS4-1512 misc Martin, Alexander; Geißler, Björn; Hayn, Christine; Hiller, Benjamin; Humpola, Jesco; Koch, Thorsten; Lehmann, Thomas; Morsi, Antonio; Pfetsch, Marc; Schewe, Lars; Schmidt, Martin; Schultz, Rüdiger; Schwarz, Robert; Schweiger, Jonas; Steinbach, Marc; Willert, Bernhard Optimierung Technischer Kapazitäten in Gasnetzen Die mittel- und längerfristige Planung für den Gastransport hat sich durch Änderungen in den regulatorischen Rahmenbedingungen stark verkompliziert. Kernpunkt ist die Trennung von Gashandel und -transport. Dieser Artikel diskutiert die hieraus resultierenden mathematischen Planungsprobleme, welche als Validierung von Nominierungen und Buchungen, Bestimmung der technischen Kapazität und Topologieplanung bezeichnet werden. Diese mathematischen Optimierungsprobleme werden vorgestellt und Lösungsansätze skizziert. 2012 urn:nbn:de:0297-zib-15121 Mathematical Optimization OPUS4-6134 misc Maher, Stephen J.; Miltenberger, Matthias; Pedroso, João Pedro; Rehfeldt, Daniel; Schwarz, Robert; Serrano, Felipe PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite SCIP is a solver for a wide variety of mathematical optimization problems. It is written in C and extendable due to its plug-in based design. However, dealing with all C specifics when extending SCIP can be detrimental to development and testing of new ideas. This paper attempts to provide a remedy by introducing PySCIPOpt, a Python interface to SCIP that enables users to write new SCIP code entirely in Python. We demonstrate how to intuitively model mixed-integer linear and quadratic optimization problems and moreover provide examples on how new Python plug-ins can be added to SCIP. 2016 urn:nbn:de:0297-zib-61348 10.1007/978-3-319-42432-3_37 Mathematical Optimization OPUS4-6045 Konferenzveröffentlichung Maher, Stephen J.; Miltenberger, Matthias; Pedroso, João Pedro; Rehfeldt, Daniel; Schwarz, Robert; Serrano, Felipe PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite SCIP is a solver for a wide variety of mathematical optimization problems. It is written in C and extendable due to its plug-in based design. However, dealing with all C specifics when extending SCIP can be detrimental to development and testing of new ideas. This paper attempts to provide a remedy by introducing PySCIPOpt, a Python interface to SCIP that enables users to write new SCIP code entirely in Python. We demonstrate how to intuitively model mixed-integer linear and quadratic optimization problems and moreover provide examples on how new Python plug-ins can be added to SCIP. Springer 2016 6 Mathematical Software – ICMS 2016 9725 301 307 10.1007/978-3-319-42432-3_37 Mathematical Optimization OPUS4-5767 misc Gamrath, Gerald; Fischer, Tobias; Gally, Tristan; Gleixner, Ambros; Hendel, Gregor; Koch, Thorsten; Maher, Stephen J.; Miltenberger, Matthias; Müller, Benjamin; Pfetsch, Marc; Puchert, Christian; Rehfeldt, Daniel; Schenker, Sebastian; Schwarz, Robert; Serrano, Felipe; Shinano, Yuji; Vigerske, Stefan; Weninger, Dieter; Winkler, Michael; Witt, Jonas T.; Witzig, Jakob The SCIP Optimization Suite 3.2 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. 2016 urn:nbn:de:0297-zib-57675 Mathematical Optimization