TY - JOUR A1 - Fügenschuh, Armin A1 - Göttlich, Simone A1 - Herty, Michael A1 - Klar, Alexander A1 - Martin, Alexander T1 - A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations JF - SIAM Journal on Scientific Computing Y1 - 2008 VL - 30 IS - 3 SP - 1490 EP - 1507 ER - TY - CHAP A1 - Birkhofer, Herbert A1 - Fügenschuh, Armin A1 - Günther, Ute A1 - Junglas, Daniel A1 - Martin, Alexander A1 - Sauer, Thorsten A1 - Ulbrich, Stefan A1 - Wäldele, Martin A1 - Walter, Stephan ED - Haasis, Hans-Dietrich ED - Kopfer, Herbert ED - Schönberger, Jörn T1 - Topology- and shape-optimization of branched sheet metal products T2 - Operations Research Proceedings Y1 - 2006 SP - 327 EP - 336 ER - TY - CHAP A1 - Birkhofer, Herbert A1 - Fügenschuh, Armin A1 - Martin, Alexander A1 - Wäldele, Martin T1 - Algorithmenbasierte Produktentwicklung für integrale Blechbauweisen höherer Verzweigungsordnung T2 - Optimierung in der Produktentwicklung, 5. Geimeinsames Kolloquium Konstruktionstechnik Y1 - 2007 ER - TY - JOUR A1 - Pfetsch, Marc A1 - Fügenschuh, Armin A1 - Geißler, Björn A1 - Geißler, Nina A1 - Gollmer, Ralf A1 - Hiller, Benjamin A1 - Humpola, Jesco A1 - Koch, Thorsten A1 - Lehmann, Thomas A1 - Martin, Alexander A1 - Morsi, Antonio A1 - Rövekamp, Jessica A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Schultz, Rüdiger A1 - Schwarz, Robert A1 - Schweiger, Jonas A1 - Stangl, Claudia A1 - Steinbach, Marc A1 - Vigerske, Stefan A1 - Willert, Bernhard T1 - Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions JF - Optimization Methods and Software N2 - 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. Y1 - 2014 U6 - https://doi.org/10.1080/10556788.2014.888426 PB - Taylor & Francis ER - TY - JOUR A1 - Fügenschuh, Armin A1 - Geißler, Björn A1 - Gollmer, Ralf A1 - Hayn, Christine A1 - Henrion, René A1 - Hiller, Benjamin A1 - Humpola, Jesco A1 - Koch, Thorsten A1 - Lehmann, Thomas A1 - Martin, Alexander A1 - Mirkov, Radoslava A1 - Morsi, Antonio A1 - Römisch, Werner A1 - Rövekamp, Jessica A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Schultz, Rüdiger A1 - Schwarz, Robert A1 - Schweiger, Jonas A1 - Stangl, Claudia A1 - Steinbach, Marc A1 - Willert, Bernhard T1 - Mathematical optimization for challenging network planning problems in unbundled liberalized gas markets JF - Energy Systems N2 - 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. Y1 - 2013 U6 - https://doi.org/10.1007/s12667-013-0099-8 VL - 5 IS - 3 SP - 449 EP - 473 PB - Springer Berlin Heidelberg CY - Berlin ER - TY - GEN A1 - Fügenschuh, Armin A1 - Geißler, Björn A1 - Gollmer, Ralf A1 - Hayn, Christine A1 - Henrion, Rene A1 - Hiller, Benjamin A1 - Humpola, Jesco A1 - Koch, Thorsten A1 - Lehmann, Thomas A1 - Martin, Alexander A1 - Mirkov, Radoslava A1 - Morsi, Antonio A1 - Römisch, Werner A1 - Rövekamp, Jessica A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Schultz, Rüdiger A1 - Schwarz, Robert A1 - Schweiger, Jonas A1 - Stangl, Claudia A1 - Steinbach, Marc A1 - Willert, Bernhard T1 - Mathematical Optimization for Challenging Network Planning Problems in Unbundled Liberalized Gas Markets N2 - 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. T3 - ZIB-Report - 13-13 KW - Gas Market Liberalization KW - Entry-Exit Model KW - Gas Network Access Regulation KW - Mixed-Integer Nonlinear Nonconvex Stochastic Optimization Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-17821 SN - 1438-0064 ER - TY - GEN A1 - Pfetsch, Marc A1 - Fügenschuh, Armin A1 - Geißler, Björn A1 - Geißler, Nina A1 - Gollmer, Ralf A1 - Hiller, Benjamin A1 - Humpola, Jesco A1 - Koch, Thorsten A1 - Lehmann, Thomas A1 - Martin, Alexander A1 - Morsi, Antonio A1 - Rövekamp, Jessica A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Schultz, Rüdiger A1 - Schwarz, Robert A1 - Schweiger, Jonas A1 - Stangl, Claudia A1 - Steinbach, Marc A1 - Vigerske, Stefan A1 - Willert, Bernhard T1 - Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions N2 - 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. T3 - ZIB-Report - 12-41 Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-16531 SN - 1438-0064 ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Koch, Thorsten A1 - Martin, Alexander A1 - Achterberg, Tobias A1 - Fügenschuh, Armin A1 - Koster, Arie M.C.A. A1 - Wegel, Oliver A1 - Wessäly, Roland ED - Anandalingam, G. ED - Raghavan, S. T1 - Modelling Feasible Network Configurations for UMTS T2 - Telecommunications Network Design and Management Y1 - 2003 UR - http://opus.kobv.de/zib/volltexte/2002/684/ PB - Kluver ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Geerdes, Hans-Florian A1 - Junglas, Daniel A1 - Koch, Thorsten A1 - Martin, Alexander ED - Ahr, Dino ED - Fahrion, Roland ED - Oswald, Marcus ED - Reinelt, Gerhard T1 - Optimisation Methods for UMTS Radio Network Planning T2 - Operation Research Proceedings 2003 Y1 - 2003 U6 - https://doi.org/10.1007/978-3-642-17022-5_5 SP - 31 EP - 38 PB - Springer ER - TY - GEN A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Koch, Thorsten A1 - Koster, Arie M.C.A. A1 - Martin, Alexander A1 - Pfender, Tobias A1 - Wegel, Oliver A1 - Wessäly, Roland T1 - Modelling Feasible Network Configurations for UMTS N2 - A model for the optimisation of the location and configuration of base stations in a UMTS network is described. The focus is primarily on modelling the configuration problem sufficiently accurate using mixed-integer variables and (essentially) linear constraints. These constraints reflect the limited downlink code capacity in each cell, the interference limitations for successful up- and downlink transmissions, the need for sufficiently strong (cell) pilot signals, and the potential gain for mobiles from being in soft(er) hand-over. It is also explained how to use the model as a basis for rating network configurations. T3 - ZIB-Report - 02-16 KW - UMTS KW - radio interface KW - network planning KW - configuration KW - perfect power control KW - mathematical model KW - mixed integer programming KW - MOMENTUM KW - IST-20 Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6837 ER - TY - GEN A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Geerdes, Hans-Florian A1 - Junglas, Daniel A1 - Koch, Thorsten A1 - Martin, Alexander T1 - Optimization Methods for UMTS Radio Network Planning N2 - The UMTS radio network planning problem poses the challenge of designing a cost-effective network that provides users with sufficient coverage and capacity. We describe an optimization model for this problem that is based on comprehensive planning data of the EU project MOMENTUM. We present heuristic mathematical methods for this realistic model, including computational results. T3 - ZIB-Report - 03-41 Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7637 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Hess, Wolfgang A1 - Martin, Alexander A1 - Ulbrich, Stefan ED - Groche, P. T1 - Diskrete und kontinuierliche Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen T2 - Sonderforschungsbereich 666 Y1 - 2007 SP - 37 EP - 47 ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Koch, Thorsten A1 - Koster, Arie M.C.A. A1 - Martin, Alexander A1 - Pfender, Tobias A1 - Wegel, Oliver A1 - Wessäly, Roland ED - G. Anandalingam, S. T1 - Mathematical Model of Feasible Network Configurations for UMTS T2 - Telecommunications network design and management Y1 - 2002 SP - 1 EP - 24 PB - Kluwer ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Martin, Alexander A1 - Stöveken, Peter ED - Bixby, Robert E. ED - Simchi-Levi, D. ED - Martin, Alexander ED - Zimmermann, U. T1 - Integrated Optimization of School Starting Times and Public Bus Services T2 - Mathematics in the Supply Chain Y1 - 2004 ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Geerdes, Hans-Florian A1 - Junglas, Daniel A1 - Koch, Thorsten A1 - Martin, Alexander T1 - Integer Programming Methods for UMTS Radio Network Planning T2 - Proceedings of the WiOpt’04, Cambridge, UK Y1 - 2004 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Martin, Alexander ED - Aardal, Karen I. ED - Nemhauser, George ED - Weismantel, R. T1 - Computational Integer Programming and Cutting Planes T2 - Handbooks in Operations Research and Management Science, Vol. 12 Y1 - 2005 SP - 69 EP - 122 PB - North-Holland ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Homfeld, Henning A1 - Huck, Andreas A1 - Martin, Alexander ED - Jacob, R. ED - Müller-Hannemann, Matthias T1 - Locomotive and Wagon Scheduling in Freight Transport T2 - Proceedings of the ATMOS06 Y1 - 2006 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Martin, Alexander A1 - Mehlert, Christian A1 - Stöveken, Peter ED - Günther, H.-O. ED - Mattfeld, D. ED - Suhl, L. T1 - Ein Planungstool zur Schulzeitstaffelung T2 - Supply Chain Management und Logistik Y1 - 2005 SP - 419 EP - 436 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Martin, Alexander A1 - Stöveken, Peter ED - Fleuren, Hein ED - den Hertog, Dick ED - Kort, Peter T1 - Integrated Optimization of School Starting Times and Public Bus Services T2 - Operations Research Proceedings Y1 - 2005 SP - 150 EP - 157 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Martin, Alexander T1 - Mixed-integer models for topology optimization in sheet metal design T2 - Sixth International Congress on Industrial Applied Mathematics (ICIAM07) and GAMM Annual Meeting, Zürich 2007 Y1 - 2007 SP - 2060049 EP - 2060050 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - ler, Björn A1 - Martin, Alexander A1 - Morsi, Antonio ED - Barnhart, Cynthia ED - Clausen, Uwe ED - Lauther, Ulrich ED - Möhring, Rolf T1 - The Transport PDE and Mixed-Integer Linear Programming T2 - Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Deutschland Y1 - 2009 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Hess, Wolfgang A1 - Schewe, Lars A1 - Martin, Alexander A1 - Ulbrich, Stefan ED - Groche, P. T1 - Verfeinerte Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen mit Kammern T2 - Sonderforschungsbereich 666 Y1 - 2008 SP - 17 EP - 28 ER - TY - JOUR A1 - Dür, Mirjam A1 - Fügenschuh, Armin A1 - Martin, Alexander A1 - Schabel, Samuel A1 - Schönberger, Christine A1 - Villforth, Klaus T1 - Steuerung einer Sortieranlage, z.B. für Altpapier JF - Europäische Patentanmeldung Y1 - 2010 VL - EP 09 718 564.9 ER - TY - JOUR A1 - Fügenschuh, Armin A1 - Herty, Michael A1 - Klar, Axel A1 - Martin, Alexander T1 - Combinatorial and Continuous Models and Optimization for Traffic Flow on Networks JF - SIAM Journal on Optimization Y1 - 2006 VL - 16 IS - 4 SP - 1155 EP - 1176 ER - TY - JOUR A1 - Fügenschuh, Armin A1 - Martin, Alexander T1 - Welche Gemeinsamkeiten haben Jugendliche und Groß banken? JF - mathematiklehren Y1 - 2006 VL - 129 SP - 50 EP - 54 ER -