@article{DuerFuegenschuhMartinetal.2006, author = {D{\"u}r, Mirjam and F{\"u}genschuh, Armin and Martin, Alexander and Ulbrich, Stefan}, title = {Verfahren und Vorrichtung zum Auswuchten von wellenelastischen Rotoren}, volume = {DE 10 2006 060 583.7}, journal = {Deutsche Patentanmeldung}, year = {2006}, language = {en} } @article{Fuegenschuh2006, author = {F{\"u}genschuh, Armin}, title = {The Vehicle Routing Problem with Coupled Time Windows}, volume = {14}, journal = {Central European Journal of Operations Research}, number = {2}, pages = {157 -- 176}, year = {2006}, language = {en} } @article{DittelFuegenschuhGoettlichetal.2009, author = {Dittel, Agnes and F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Herty, Michael}, title = {MIP Presolve Techniques for a PDE-based Supply Chain Model}, volume = {24}, journal = {Optimization Methods \& Software}, number = {3}, pages = {427 -- 445}, year = {2009}, language = {en} } @article{Fuegenschuh2009, author = {F{\"u}genschuh, Armin}, title = {Scheduling School Starting Times and Public Buses}, volume = {20}, journal = {SIAG/OPT Views-and-News}, number = {1}, pages = {1 -- 6}, year = {2009}, language = {en} } @article{FuegenschuhGoettlichKirchneretal.2009, author = {F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Kirchner, Claus and Herty, Michael and Martin, Alexander}, title = {Efficient Reformulation and Solution of a Nonlinear PDE-Controlled Flow Network Model}, volume = {85}, journal = {Computing}, number = {3}, pages = {245 -- 265}, year = {2009}, language = {en} } @article{FrankFuegenschuhHertyetal.2010, author = {Frank, Martin and F{\"u}genschuh, Armin and Herty, Michael and Schewe, Lars}, title = {The Coolest Path Problem}, volume = {5}, journal = {Networks and Heterogeneous Media}, number = {1}, pages = {143 -- 162}, year = {2010}, language = {en} } @article{Fuegenschuh2007, author = {F{\"u}genschuh, Armin}, title = {Spalten am St{\"u}ck - Maschinenbauer, Materialwissenschaftler und Mathematiker erfinden die Blechbearbeitung neu}, volume = {2}, journal = {hoch\$^3\$}, pages = {19}, year = {2007}, language = {en} } @article{Fuegenschuh2007, author = {F{\"u}genschuh, Armin}, title = {Bestes Blech - Der hochkomplexe unsichtbare Weg zum pr{\"a}zisen und belastbaren Bauteil}, volume = {2}, journal = {hoch\$^3\$}, pages = {20}, year = {2007}, language = {en} } @article{FuegenschuhGoettlichHertyetal.2008, author = {F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Herty, Michael and Klar, Alexander and Martin, Alexander}, title = {A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations}, volume = {30}, journal = {SIAM Journal on Scientific Computing}, number = {3}, pages = {1490 -- 1507}, year = {2008}, language = {en} } @article{FuegenschuhHomfeldHucketal.2008, author = {F{\"u}genschuh, Armin and Homfeld, Henning and Huck, Andreas and Martin, Alexander and Yuan, Zhi}, title = {Scheduling Locomotives and Car Transfers in Freight Transport}, volume = {42}, journal = {Transportation Science}, number = {4}, pages = {1 -- 14}, year = {2008}, language = {en} } @article{Fuegenschuh2009, author = {F{\"u}genschuh, Armin}, title = {Solving a School Bus Scheduling Problem with Integer Programming}, volume = {193}, journal = {European Journal of Operational Research}, number = {3}, pages = {867 -- 884}, year = {2009}, language = {en} } @article{FuegenschuhMartin2006, author = {F{\"u}genschuh, Armin and Martin, Alexander}, title = {A Multicriterial Approach for Optimizing Bus Schedules and School Starting Times}, volume = {147}, journal = {Annals of Operations Research}, number = {1}, pages = {199 -- 216}, year = {2006}, language = {en} } @article{Fuegenschuh2006, author = {F{\"u}genschuh, Armin}, title = {Optimal verkn{\"u}pft - Schulanfangszeiten und {\"o}ffentlicher Personennahverkehr}, volume = {1}, journal = {thema forschung}, pages = {82 -- 85}, year = {2006}, language = {en} } @article{Fuegenschuh2006, author = {F{\"u}genschuh, Armin}, title = {Optimierte Schulanfangszeiten}, volume = {28}, journal = {OR News}, pages = {25 -- 27}, year = {2006}, language = {en} } @article{EisenblaetterFuegenschuhFledderusetal.2003, author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Fledderus, E. and Geerdes, Hans-Florian and Heideck, B. and Junglas, Daniel and Koch, Thorsten and K{\"u}rner, T. and Martin, Alexander}, title = {Mathematical Methods for Automatic Optimization of UMTS Radio Networks}, number = {D4.3}, editor = {Martin, Alexander}, publisher = {IST-2000-28088 MOMENTUM}, year = {2003}, language = {en} } @article{Fuegenschuh2006, author = {F{\"u}genschuh, Armin}, title = {Mathematische Modelle zur betrieblichen Optimierung}, volume = {1}, journal = {Z! - das Zukunftsmagazin}, pages = {3}, year = {2006}, language = {en} } @misc{DittelFuegenschuhMartin2011, author = {Dittel, Agnes and F{\"u}genschuh, Armin and Martin, Alexander}, title = {Polyhedral Aspects of Self-Avoiding Walks}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-12576}, number = {11-11}, year = {2011}, abstract = {In this paper, we study self-avoiding walks of a given length on a graph. We consider a formulation of this problem as a binary linear program. We analyze the polyhedral structure of the underlying polytope and describe valid inequalities. Proofs for their facial properties for certain special cases are given. In a variation of this problem one is interested in optimal configurations, where an energy function measures the benefit if certain path elements are placed on adjacent vertices of the graph. The most prominent application of this problem is the protein folding problem in biochemistry. On a set of selected instances, we demonstrate the computational merits of our approach.}, language = {en} } @article{HumpolaFuegenschuh2015, author = {Humpola, Jesco and F{\"u}genschuh, Armin}, title = {Convex reformulations for solving a nonlinear network design problem}, volume = {62}, journal = {Computational Optimization and Applications}, number = {3}, publisher = {Springer US}, doi = {10.1007/s10589-015-9756-2}, pages = {717 -- 759}, year = {2015}, abstract = {We consider a nonlinear nonconvex network design problem that arises, for example, in natural gas or water transmission networks. Given is such a network with active and passive components, that is, valves, compressors, control valves (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes in the network. The active elements are associated with costs when used. Besides flow conservation constraints in the nodes, the flow must fulfill nonlinear nonconvex pressure loss constraints on the arcs subject to potential values (i.e., pressure levels) in both end nodes of each arc. The problem is to compute a cost minimal setting of the active components and numerical values for the flow and node potentials. We examine different (convex) relaxations for a subproblem of the design problem and benefit from them within a branch-and-bound approach. We compare different approaches based on nonlinear optimization numerically on a set of test instances.}, language = {en} } @incollection{HumpolaFuegenschuhHilleretal.2015, author = {Humpola, Jesco and F{\"u}genschuh, Armin and Hiller, Benjamin and Koch, Thorsten and Lehmann, Thomas and Lenz, Ralf and Schwarz, Robert and Schweiger, Jonas}, title = {The Specialized MINLP Approach}, volume = {SIAM-MOS series on Optimization}, booktitle = {Evaluating Gas Network Capacities}, isbn = {9781611973686}, year = {2015}, abstract = {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.}, language = {en} } @misc{FuegenschuhJunoszaSzaniawskiKlugetal.2015, author = {F{\"u}genschuh, Armin and Junosza-Szaniawski, Konstanty and Klug, Torsten and Kwasiborski, Slawomir and Schlechte, Thomas}, title = {Fastest, average and quantile schedule}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-53592}, year = {2015}, abstract = {We consider problems concerning the scheduling of a set of trains on a single track. For every pair of trains there is a minimum headway, which every train must wait before it enters the track after another train. The speed of each train is also given. Hence for every schedule - a sequence of trains - we may compute the time that is at least needed for all trains to travel along the track in the given order. We give the solution to three problems: the fastest schedule, the average schedule, and the problem of quantile schedules. The last problem is a question about the smallest upper bound on the time of a given fraction of all possible schedules. We show how these problems are related to the travelling salesman problem. We prove NP-completeness of the fastest schedule problem, NP-hardness of quantile of schedules problem, and polynomiality of the average schedule problem. We also describe some algorithms for all three problems. In the solution of the quantile problem we give an algorithm, based on a reverse search method, generating with polynomial delay all Eulerian multigraphs with the given degree sequence and a bound on the number of such multigraphs. A better bound is left as an open question.}, language = {en} }