Library

Description: Das heutige Leben ist durchdrungen von komplexen Technologien. Ohne Kommunikationsnetze, Internet, Mobilfunk, Logistik, Verkehrstechnik, medizinische Apparate, etc. könnte die moderne Gesellschaft nicht funktionieren. Fast alle dieser Technologien haben einen hohen Mathematikanteil. Der "normale Bürger"' weiss davon nichts, der Schulunterricht könnte dem ein wenig abhelfen. Einige mathematische Aspekte dieser Technologien sind einfach und sogar spielerisch intuitiv zugänglich. Solche Anwendungen, die zusätzlich noch der Lebensumwelt der Schüler zugehören, können dazu genutzt werden, die mathematische Modellierung, also die mathematische Herangehensweise an die Lösung praktischer Fragen, anschaulich zu erläutern. Gerade in der diskreten Mathematik können hier, quasi "nebenbei" mathematische Theorien erarbeitet und Teilaspekte (Definitionen, Fragestellungen, einfache Sachverhalte) durch eigenständiges Entdecken der Schüler entwickelt werden. Wir beginnen mit einigen Beispielen.

Description: Den kürzesten Weg in einem Graphen zu finden ist ein klassisches Problem der Graphentheorie. Über einen Vortrag zu diesem Thema beim Tag der Mathematik 2007 von R. Borndörfer kam ich in Kontakt mit dem Konrad-Zuse-Zentrum (ZIB), das sich u.a. mit Wegeoptimierung beschäftigt. Ein Forschungsschwerpunkt dort ist im Rahmen eines Projekts zur Chipverifikation das Zählen von Lösungen, das, wie wir sehen werden, eng mit dem Zählen von Wegen zusammenhängt. Anhand von zwei Fragen aus der Graphentheorie soll diese Facharbeit unterschiedliche Lösungsmethoden untersuchen. Wie bestimmt man den kürzesten Weg zwischen zwei Knoten in einem Graphen und wie findet man alle möglichen Wege? Nach einer Einführung in die Graphentheorie und einer Konkretisierung der Probleme wird zunächst für beide eine Lösung mit auf Graphen basierenden Algorithmen vorgestellt. Während der Algorithmus von Dijkstra sehr bekannt ist, habe ich für das Zählen von Wegen einen eigenen Algorithmus auf der Basis der Tiefensuche entwickelt. Im zweiten Teil der Arbeit wird das Konzept der ganzzahligen Programmierung vorgestellt und die Lösungsmöglichkeiten für Wegeprobleme, die sich darüber ergeben. Schließlich wurden die vorgestellten Algorithmen am Beispiel des S- und U-Bahnnetzes von Berlin implementiert und mit Programmen, die die gleichen Fragen über ganzzahlige Programmierung lösen, verglichen.

Description: This paper is intended to be a first step towards the continuous dependence of dynamical contact problems on the initial data as well as the uniqueness of a solution. Moreover, it provides the basis for a proof of the convergence of popular time integration schemes as the Newmark method. We study a frictionless dynamical contact problem between both linearly elastic and viscoelastic bodies which is formulated via the Signorini contact conditions. For viscoelastic materials fulfilling the Kelvin-Voigt constitutive law, we find a characterization of the class of problems which satisfy a perturbation result in a non-trivial mix of norms in function space. This characterization is given in the form of a stability condition on the contact stresses at the contact boundaries. Furthermore, we present perturbation results for two well-established approximations of the classical Signorini condition: The Signorini condition formulated in velocities and the model of normal compliance, both satisfying even a sharper version of our stability condition.

Description: 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.

Description: This paper introduces the "line connectivity problem", a generalization of the Steiner tree problem and a special case of the line planning problem. We study its complexity and give an IP formulation in terms of an exponential number of constraints associated with "line cut constraints". These inequalities can be separated in polynomial time. We also generalize the Steiner partition inequalities.

Description: Testing is the process of stimulating a system with inputs in order to reveal hidden parts of the system state. In the case of non-deterministic systems, the difficulty arises that an input pattern can generate several possible outcomes. Some of these outcomes allow to distinguish between different hypotheses about the system state, while others do~not. In this paper, we present a novel approach to find, for non-deterministic systems modeled as constraints over variables, tests that allow to distinguish among the hypotheses as good as possible. The idea is to assess the quality of a test by determining the ratio of distinguishing (good) and not distinguishing (bad) outcomes. This measure refines previous notions proposed in the literature on model-based testing and can be computed using model counting techniques. We propose and analyze a greedy-type algorithm to solve this test optimization problem, using existing model counters as a building block. We give preliminary experimental results of our method, and discuss possible improvements.

Description: Starting with the description of the Traveling Salesmen Problem formulation as given by van Vyve and Wolsey in the article Approximate extended formulations'', we investigate the effects of small variations onto the performance of contemporary mixed integer programming solvers. We will show that even minor changes in the formulation of the model can result in performance difference of more than a factor of 1000. As the results show it is not obvious which changes will result in performance improvements and which not.

Description: Orbitopes can be used to handle symmetries which arise in integer programming formulations with an inherent assignment structure. We investigate the detection of symmetries appearing in this approach. We show that detecting so-called orbitopal symmetries is graph-isomorphism hard in general, but can be performed in linear time if the assignment structure is known.

Description: Regional hyperthermia is a cancer therapy aiming at heating tumors using phased array applicators. This article provides an overview over current mathematical challenges of delivering individually optimal treatments. The focus is on therapy planning and identification of technical as well as physiological quantities from MR thermometry measurements.

Description: Reasons for the failure of adaptive methods to deliver improved efficiency when integrating monodomain models for myocardiac excitation are discussed. Two closely related techniques for reducing the computational complexity of linearly implicit integrators, deliberate sparsing and splitting, are investigated with respect to their impact on computing time and accuracy.

Description: We investigate the computation of periodic timetables for public transport by mixed integer programming. After introducing the problem, we describe two mathematical models for periodic timetabling, the PERIODIC EVENT SCHEDULING PROBLEM (PESP) and the QUADRATIC SEMI-ASSIGNMENT PROBLEM. Specifically, we give an overview of existing integer programming (IP) formulations for both models. An important contribution of our work are new IP formulations for the PESP based on time discretization. We provide an analytical comparison of these formulations and describe different techniques that allow a more efficient solution by mixed integer programming. In a preliminary computational study, on the basis of standard IP solvers, we compare different formulations for computing periodic timetables. Our results justify a further investigation of the time discretization approach. Typically the timetable is optimized for the current traffic situation. The main difficulty with this approach is that after introducing the new timetable the passengers’ travel behavior may differ from that assumed for the computation. Motivated by this problem, we examine an iterative timetabling procedure that is a combination of timetable computation and passenger routing. We discuss the algorithmic issues of the passenger routing and study properties of the computed timetables. Finally, we confirm our theoretical results on the basis of an own implementation.

Description: Wir untersuchen die Berechnung von Taktfahrplänen für den öffentlichen Verkehr mit gemischt-ganzzahliger Programmierung (MIP). Im Anschluss an die Problembeschreibung, stellen wir zwei mathematische Modellierungen vor, das PERIODIC EVENT SCHEDULING PROBLEM (PESP) und das QUADRATIC SEMI-ASSIGNMENT PROBLEM. Wichtiger Bestandteil ist ein Überblick über existierende ganzzahlige Formulierungen beider Modelle. Wir entwickeln neue ganzzahlige Formulierungen für das PESP auf der Basis von Zeitdiskretisierung. Diese werden analytisch miteinander verglichen und wir beschreiben verschiedene Techniken, die eine effizientere Lösung der Formulierungen mit gemischt-ganzzahliger Programmierung ermöglichen. In einer ersten Rechenstudie, unter Verwendung gängiger MIP-Löser, vergleichen wir verschiedene ganzzahlige Formulierungen zur Berechnung von Taktfahrplänen. Unsere Ergebnisse rechtfertigen eine weitere Untersuchung des Zeitdiskretisierungsansatzes. In der Regel werden Fahrpläne mit Bezug auf die gegenwärtige Verkehrssituation optimiert. Dies birgt jedoch folgendes Problem. Wenn der neue Fahrplan eingeführt wird, ist es möglich, dass die Passagiere ein anderes Fahrverhalten zu Tage legen, als für die Berechnung des Fahrplans angenommen wurde. Vor diesem Hintergrund behandeln wir ein iteratives Verfahren zur Berechnung von Taktfahrplänen. Dieses ist eine Kombination aus Fahrplanberechnung und Passagierrouting. Neben den algorithmischen Details des Passagierroutings untersuchen wir Eigenschaften der berechneten Fahrpläne. Abschließend bestätigen wir unsere theoretischen Ergebnisse auf Grundlage einer eigenen Implementierung des Verfahrens.

Description: 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.

Description: Dieser kurze Aufsatz zur Algorithmengeschichte ist Eberhard Knobloch, meinem Lieblings-Mathematikhistoriker, zum 65. Geburtstag gewidmet. Eberhard Knobloch hat immer, wenn ich ihm eine historische Frage zur Mathematik stellte, eine Antwort gewusst – fast immer auch sofort. Erst als ich mich selbst ein wenig und dazu amateurhaft mit Mathematikgeschichte beschäftigte, wurde mir bewusst, wie schwierig dieses „Geschäft“ ist. Man muss nicht nur mehrere (alte) Sprachen beherrschen, sondern auch die wissenschaftliche Bedeutung von Begriffen und Symbolen in früheren Zeiten kennen. Man muss zusätzlich herausfinden, was zur Zeit der Entstehung der Texte „allgemeines Wissen“ war, insbesondere, was seinerzeit gültige Beweisideen und -schritte waren, und daher damals keiner präzisen Definition oder Einführung bedurfte. Es gibt aber noch eine Steigerung des historischen Schwierigkeitsgrades: Algorithmengeschichte. Dies möchte ich in diesem Artikel kurz darlegen in der Hoffnung, dass sich Wissenschaftshistoriker dieses Themas noch intensiver annehmen, als sie das bisher tun. Der Grund ist, dass heute Algorithmen viele Bereiche unserer Alltagswelt steuern und unser tägliches Leben oft von funktionierenden Algorithmen abhängt. Daher wäre eine bessere Kenntnis der Algorithmengeschichte von großem Interesse.

Description: We consider first order optimality conditions for state constrained optimal control problems. In particular we study the case where the state equation has not enough regularity to admit existence of a Slater point in function space. We overcome this difficulty by a special transformation. Under a density condition we show existence of Lagrange multipliers, which have a representation via measures and additional regularity properties.

Description: The enormous time lag between fast atomic motion and complex pro- tein folding events makes it almost impossible to compute molecular dy- namics on a high resolution. A common way to tackle this problem is to model the system dynamics as a Markov process. Yet for large molec- ular systems the resulting Markov chains can hardly be handled due to the curse of dimensionality. Coarse graining methods can be used to re- duce the dimension of a Markov chain, but it is still unclear how far the coarse grained Markov chain resembles the original system. In order to answer this question, two different coarse-graining methods were analysed and compared: a classical set-based reduction method and an alternative subspace-based approach, which is based on membership vectors instead of sets. On the basis of a small toy system, it could be shown, that in con- trast to the subset-based approach, the subspace-based reduction method preserves the Markov property as well as the essential dynamics of the original system.

Description: Line planning is an important step in the strategic planning process of a public transportation system. In this paper, we discuss an optimization model for this problem in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the problem for path and tree network topologies as well as several categories of line operation that are important for the Quito Trolebus system. It turns out that, from a computational complexity worst case point of view, the problem is hard in all but the most simple variants. In practice, however, instances based on real data from the Trolebus System in Quito can be solved quite well, and significant optimization potentials can be demonstrated.

Description: It is well known that competitive analysis yields too pessimistic results when applied to the paging problem and it also cannot make a distinction between many paging strategies. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the good performing least-recently-used (LRU). In this paper, we study this fundamental online problem from the viewpoint of stochastic dominance. We show that when sequences are drawn from distributions modelling locality of reference, LRU is stochastically better than any other online paging algorithm.

Description: In this paper we propose a technique for a priori turbulent flame speed tabulation (TFST) for a given parameter space in standard combustion-regime diagrams. It can be used as a subgrid-scale (SGS) model in Large Eddy Simulation (LES). In a first step, stationary laminar flamelets are computed and stored over the progress variable following the ideas of flamelet generated manifolds (FGM). In a second step, the incompressible one-dimensional Navier-Stokes equations supplemented by the equation for the progress variable are solved on a grid that resolves all turbulent scales. Additionally, turbulent transport is implemented via the linear eddy model (LEM). The turbulent flame structures are solved until a statistically stationary mean value of the turbulent flame speed has been reached. The results are stored in a table that could be used by large scale premixed combustion models, e.g. front tracking schemes. Results are compared to an algebraic model and to direct numerical simulations (DNS).

Description: Die Angebotsplanung im öffentlichen Nahverkehr umfasst die Aufgaben der Netz-, Linien-,Fahr- und Preisplanung. Wir stellen zwei mathematische Optimierungsmodelle zur Linien- und Preisplanung vor. Wir zeigen anhand von Berechnungen für die Verkehrsbetriebe in Potsdam(ViP), dass sich damit komplexe Zusammenhänge quantitativ analysieren lassen. Auf diese Weise untersuchen wir die Auswirkungen von Freiheitsgraden auf die Konstruktion von Linien und die Wahl von Reisewegen der Passagiere, Abhängigkeiten zwischen Kosten und Reisezeiten sowie den Einfluss verschiedener Preissysteme auf Nachfrage und Kostendeckung.

Description: The influence of thermal stratification on autoignition at constant volume and high pressure is investigated under turbulent conditions using the one-dimensional Linear-Eddy Model (LEM) and detailed hydrogen/air chemistry. Results are presented for the influence of initial temperature inhomogeneities on the heat release rate and the relative importance of diffusion and chemical reactions. The predicted heat release rates are compared with heat release rates of Chen et al. and Hawkes et al. obtained by two-dimensional Direct Numerical Simulations (DNS). Using the definition of Chen et al. for the displacement speed of the H2 mass fraction tracked at the location of maximum heat release, and a comparison of budget terms, different combustion modes including ignition front propagation and deflagration waves are identified and the results are compared to the DNS data. The LEM approach shows qualitatively and quantitatively reasonable agreement with the DNS data over the whole range of investigated temperature fluctuations. The results presented in this work suggest that LEM is a potential candidate as a sub-model for CFD calculations of HCCI engines.

Description: This article introduces constraint integer programming (CIP), which is a novel way to combine constraint programming (CP) and mixed integer programming (MIP) methodologies. CIP is a generalization of MIP that supports the notion of general constraints as in CP. This approach is supported by the CIP framework SCIP, which also integrates techniques from SAT solving. SCIP is available in source code and free for non-commercial use. We demonstrate the usefulness of CIP on two tasks. First, we apply the constraint integer programming approach to pure mixed integer programs. Computational experiments show that SCIP is almost competitive to current state-of-the-art commercial MIP solvers. Second, we employ the CIP framework to solve chip design verification problems, which involve some highly non-linear constraint types that are very hard to handle by pure MIP solvers. The CIP approach is very effective here: it can apply the full sophisticated MIP machinery to the linear part of the problem, while dealing with the non-linear constraints by employing constraint programming techniques.

Description: An extended mathematical framework for barrier methods for state constrained optimal control compared to [Schiela, ZIB-Report 07-07] is considered. This allows to apply the results derived there to more general classes of optimal control problems, in particular to boundary control and finite dimensional control.

Description: In the recent years there has been tremendous progress in the development of algorithms to find optimal solutions for integer programs. In many applications it is, however, desirable (or even necessary) to generate all feasible solutions. Examples arise in the areas of hardware and software verification and discrete geometry. In this paper, we investigate how to extend branch-and-cut integer programming frameworks to support the generation of all solutions. We propose a method to detect so-called unrestricted subtrees, which allows us to prune the integer program search tree and to collect several solutions simultaneously. We present computational results of this branch-and-count paradigm which show the potential of the unrestricted subtree detection.

Description: Edmonds showed that the so-called rank inequalities and the nonnegativity constraints provide a complete linear description of the matroid polytope. By essentially adding Grötschel's cardinality forcing inequalities, we obtain a complete linear description of the cardinality constrained matroid polytope which is the convex hull of the incidence vectors of those independent sets that have a feasible cardinality. Moreover, we show how the separation problem for the cardinality forcing inequalities can be reduced to that for the rank inequalities. We also give necessary and sufficient conditions for a cardinality forcing inequality to be facet defining.

Description: The paper describes a method for solution of very large overdetermined algebraic polynomial systems on an example that appears from a classification of all integrable 3-dimensional scalar discrete quasilinear equations $Q_3=0$ on an elementary cubic cell of the lattice ${\mathbb Z}^3$. The overdetermined polynomial algebraic system that has to be solved is far too large to be formulated. A probing' technique which replaces independent variables by random integers or zero allows to formulate subsets of this system. An automatic alteration of equation formulating steps and equation solving steps leads to an iteration process that solves the computational problem.

Description: An algorithmic method using conservation law multipliers is introduced that yields necessary and sufficient conditions to find invertible mappings of a given nonlinear PDE to some linear PDE and to construct such a mapping when it exists. Previous methods yielded such conditions from admitted point or contact symmetries of the nonlinear PDE. Through examples, these two linearization approaches are contrasted.

Description: We classify all integrable 3-dimensional scalar discrete affine linear equations $Q_3=0$ on an elementary cubic cell of the lattice ${\mathbb Z}^3$. An equation $Q_3=0$ %of such form is called integrable if it may be consistently imposed on all $3$-dimensional elementary faces of the lattice ${\mathbb Z}^4$. Under the natural requirement of invariance of the equation under the action of the complete group of symmetries of the cube we prove that the only ontrivial(non-linearizable) integrable equation from this class is the well-known dBKP-system.

Description: The article describes the online mathematics test {\tt http://lie.math.brocku.ca/mathtest}, its typical applications and experiences gathered.

Description: We introduce (TTPlib), a data library for train timetabling problems that can be accessed at http://ttplib.zib.de. In version 1.0, the library contains data related to 50 scenarios. Most instances result from the combination of macroscopic railway networks and several train request sets for the German long distance area containing Hannover, Kassel and Fulda, short denoted by Ha-Ka-Fu. In this paper, we introduce the data concepts of TTPlib, describe the scenarios included in the library and provide a free visualization tool TraVis.

Description: The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary differential equations (ODEs) with coefficients that are arbitrary analytic functions in the independent variable. A second conceptual aim is to present an algorithm that is in some sense dual to the fundamental Euclids algorithm, and thus an alternative to the special case of a Gr\"{o}bner basis algorithm as it is used for solving linear ODE-systems. In the paper Euclids algorithm and the new dual version' are compared and their complementary strengths are analysed on the task of solving underdetermined ODEs. An implementation of the described algorithm is interactively accessible at http://lie.math.brocku.ca/crack/uode.

Description: This paper proposes a new method for probabilistic analysis of online algorithms that is based on the notion of stochastic dominance. We develop the method for the Online Bin Coloring problem introduced by Krumke et al. Using methods for the stochastic comparison of Markov chains we establish the strong result that the performance of the online algorithm GreedyFit is stochastically dominated by the performance of the algorithm OneBin for any number of items processed. This result gives a more realistic picture than competitive analysis and explains the behavior observed in simulations.

Description: The optimization of fare systems in public transit allows to pursue objectives such as the maximization of demand, revenue, profit, or social welfare. We propose a non-linear optimization approach to fare planning that is based on a detailed discrete choice model of user behavior. The approach allows to analyze different fare structures, optimization objectives, and operational scenarios involving, e.g., subsidies. We use the resulting models to compute optimized fare systems for the city of Potsdam, Germany.

Description: Pseudo-Boolean problems generalize SAT problems by allowing linear constraints and a linear objective function. Different solvers, mainly having their roots in the SAT domain, have been proposed and compared,for instance, in Pseudo-Boolean evaluations. One can also formulate Pseudo-Boolean models as integer programming models. That is,Pseudo-Boolean problems lie on the border between the SAT domain and the integer programming field. In this paper, we approach Pseudo-Boolean problems from the integer programming side. We introduce the framework SCIP that implements constraint integer programming techniques. It integrates methods from constraint programming, integer programming, and SAT-solving: the solution of linear programming relaxations, propagation of linear as well as nonlinear constraints, and conflict analysis. We argue that this approach is suitable for Pseudo-Boolean instances containing general linear constraints, while it is less efficient for pure SAT problems. We present extensive computational experiments on the test set used for the Pseudo-Boolean evaluation 2007. We show that our approach is very efficient for optimization instances and competitive for feasibility problems. For the nonlinear parts, we also investigate the influence of linear programming relaxations and propagation methods on the performance. It turns out that both techniques are helpful for obtaining an efficient solution method.

Description: Millionen von Menschen werden allein in Deutschland täglich von Bussen, Bahnen und Flugzeugen transportiert. Der öffentliche Personenverkehr (ÖV) ist von großer Bedeutung für die Lebensqualität einzelner aber auch für die Leistungsfähigkeit ganzer Regionen. Qualität und Effizienz von ÖV-Systemen hängen ab von politischen Rahmenbedingungen (staatlich geplant, wettbewerblich organisiert) und der Eignung der Infrastruktur (Schienensysteme, Flughafenstandorte), vom vorhandenen Verkehrsangebot (Fahr- und Flugplan), von der Verwendung angemessener Technologien (Informations-, Kontroll- und Buchungssysteme) und dem bestmöglichen Einsatz der Betriebsmittel (Energie, Fahrzeuge und Personal). Die hierbei auftretenden Entscheidungs-, Planungs- und Optimierungsprobleme sind z.T. gigantisch und "schreien" aufgrund ihrer hohen Komplexität nach Unterstützung durch Mathematik. Dieser Artikel skizziert den Stand und die Bedeutung des Einsatzes von Mathematik bei der Planung und Durchführung von öffentlichem Personenverkehr, beschreibt die bestehenden Herausforderungen und regt zukunftsweisende Maßnahmen an.

Description: Pulse thermography of concrete structures is used in civil engineering for detecting voids, honeycombing and delamination. The physical situation is readily modeled by Fourier's law. Despite the simplicity of the PDE structure, quantitatively realistic numerical 3D simulation faces two major obstacles. First, the short heating pulse induces a thin boundary layer at the heated surface which encapsulates all information and therefore has to be resolved faithfully. Even with adaptive mesh refinement techniques, obtaining useful accuracies requires an unsatisfactorily fine discretization. Second, bulk material parameters and boundary conditions are barely known exactly. We address both issues by a semi-analytic reformulation of the heat transport problem and by parameter identification. Numerical results are compared with measurements of test specimens.

Description: In this paper we are concerned with the application of interior point methods in function space to gradient constrained optimal control problems, governed by partial differential equations. We will derive existence of solutions together with first order optimality conditions. Afterwards we show continuity of the central path, together with convergence rates depending on the interior point parameter.

Description: We consider an interior point method in function space for PDE constrained optimal control problems with state constraints. Our emphasis is on the construction and analysis of an algorithm that integrates a Newton path-following method with adaptive grid refinement. This is done in the framework of inexact Newton methods in function space, where the discretization error of each Newton step is controlled by adaptive grid refinement in the innermost loop. This allows to perform most of the required Newton steps on coarse grids, such that the overall computational time is dominated by the last few steps. For this purpose we propose an a-posteriori error estimator for a problem suited norm.

Description: Ticket pricing in public transport usually takes a welfare or mnemonics maximization point of view. These approaches do not consider fairness in the sense that users of a shared infrastructure should pay for the costs that they generate. We propose an ansatz to determine fair ticket prices that combines concepts from cooperative game theory and integer programming. An application to pricing railway tickets for the intercity network of the Netherlands demonstrates that, in this sense, prices that are much fairer than standard ones can be computed in this way.

Description: We present a second order sharp interface finite volume method for the solution of the three-dimensional poisson equation with variable coefficients on Cartesian grids. In particular, we focus on interface problems with discontinuities in the coefficient, the source term, the solution, and the fluxes across the interface. The method uses standard piecewiese trilinear finite elements for normal cells and a double piecewise trilinear ansatz for the solution on cells intersected by the interface resulting always in a compact 27-point stencil. Singularities associated with vanishing partial volumes of intersected grid cells are removed by a two-term asymptotic approach. In contrast to the 2D method presented by two of the authors in [M.~Oevermann, R.~Klein: A Cartesian grid finite volume method for elliptic equations with variable coefficients and embedded interfaces, J.~Comp.~Phys.~219 (2006)] we use a minimization technique to determine the unknown coefficients of the double trilinear ansatz. This simplifies the treatment of the different cut-cell types and avoids additional special operations for degenerated interface topologies. The resulting set of linear equations has been solved with a BiCGSTAB solver preconditioned with an algebraic multigrid. In various testcases -- including large coefficient ratios and non-smooth interfaces -- the method achieves second order of accuracy in the L_inf and L_2 norm.

Description: Given a combinatorial optimization problem and a subset $N$ of natural numbers, we obtain a cardinality constrained version of this problem by permitting only those feasible solutions whose cardinalities are elements of $N$. In this paper we briefly touch on questions that addresses common grounds and differences of the complexity of a combinatorial optimization problem and its cardinality constrained version. Afterwards we focus on polytopes associated with cardinality constrained combinatorial optimization problems. Given an integer programming formulation for a combinatorial optimization problem, by essentially adding Grötschel's cardinality forcing inequalities, we obtain an integer programming formulation for its cardinality restricted version. Since the cardinality forcing inequalities in their original form are mostly not facet defining for the associated polyhedra, we discuss possibilities to strengthen them.

Description: This survey concerns optimization problems arising in the design of survivable communication networks. It turns out that such problems can be modeled in a natural way as non-compact linear programming formulations based on multicommodity flow network models. These non-compact formulations involve an exponential number of path flow variables, and therefore require column generation to be solved to optimality. We consider several path-based survivability mechanisms and present results, both known and new, on the complexity of the corresponding column generation problems (called the pricing problems). We discuss results for the case of the single link (or node) failures scenarios, and extend the considerations to multiple link failures. Further, we classify the design problems corresponding to different survivability mechanisms according to the structure of their pricing problem. Finally, we show that almost all encountered pricing problems are hard to solve for scenarios admitting multiple failures.

Description: We introduce an optimization model for the line planning problem in a public transportation system that aims at minimizing operational costs while ensuring a given level of quality of service in terms of available transport capacity. We discuss the computational complexity of the model for tree network topologies and line structures that arise in a real-world application at the Trolebus Integrated System in Quito. Computational results for this system are reported.

Description: Line planning is an important step in the strategic planning process of a public transportation system. In this paper, we discuss an optimization model for this problem in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the problem for path and tree network topologies as well as several categories of line operation that are important for the Quito Trolebus system. It turns out that, from a computational complexity worst case point of view, the problem is hard in all but the most simple variants. In practice, however, instances based on real data from the Trolebus System in Quito can be solved quite well, and significant optimization potentials can be demonstrated.

Description: In der Arbeit wird die computergestützte Planung von chirurgisch gesetzten Knochenfrakturen bzw. Knochenschnitten (sogenannten Osteotomien) an dreidimensionalen, computergrafischen Schädelmodellen, sowie die Umpositionierung separierter knöcherner Segmente im Kontext der rekonstruktiven MKG-Chirurgie behandelt. Durch die 3D Modellierung und Visualisierung anatomischer Strukturen, sowie der 3D Osteotomie- und Umstellungsplanung unter Einbeziehung der resultierenden Weichgewebedeformation wird den Chirurgen ein Werkzeug an die Hand gegeben, mit dem eine Therapieplanung am Computer durchgeführt und diese in Hinblick auf Funktion und Ästhetik bewertet werden kann. Unterschiedliche Strategien können dabei erprobt und in ihrer Auswirkung erfasst werden. Dazu wird ein methodischer Ansatz vorgestellt, der zum einen die chirurgische Planung im Vergleich zu existierenden Ansätzen deutlich verbessert und zum anderen eine robuste Weichgewebeprognose, durch den Einsatz geeigneter Planungsmodelle und eines physikalisch basierten Weichgewebemodells unter Nutzung numerischer Lösungsverfahren in die Planung integriert. Die Visualisierung der Planungsergebnisse erlaubt sowohl eine anschauliche und überzeugende, präoperative Patientenaufklärung, als auch die Demonstration möglicher Vorgehensweisen und deren Auswirkungen für die chirurgische Ausbildung. Ferner ergänzen die Planungsdaten die Falldokumentation und liefern einen Beitrag zur Qualitätssicherung. Die Arbeit ist in sieben Kapitel gegliedert und wie folgt strukturiert: Zuerst wird die medizinische Aufgabenstellung bei der chirurgischen Rekonstruktion von Knochenfehlbildungen und -fehlstellungen in der kraniofazialen Chirurgie sowie die daraus resultierenden Anforderungen an die Therapieplanung beschrieben. Anschließend folgt ein umfassender Überblick über entsprechende Vorarbeiten zur computergestützten Planung knochenverlagernder Operationen und eine kritische Bestandsaufnahme der noch vorhandenen Defizite. Nach der Vorstellung des eigenen Planungsansatzes wird die Generierung individueller, qualitativ hochwertiger 3D Planungsmodelle aus tomografischen Bilddaten beschrieben, die den Anforderungen an eine intuitive, 3D Planung von Umstellungsosteotomien entsprechen und eine Simulation der daraus resultierenden Weichgewebedeformation mittels der Finite-Elemente Methode (FEM) ermöglichen. Die Methoden der 3D Schnittplanung an computergrafischen Modellen werden analysiert und eine 3D Osteotomieplanung an polygonalen Schädelmodellen entwickelt, die es ermöglicht, intuitiv durch Definition von Schnittlinien am 3D Knochenmodell, eine den chirurgischen Anforderungen entsprechende Schnittplanung unter Berücksichtigung von Risikostrukturen durchzuführen. Separierte Knochensegmente lassen sich im Anschluss interaktiv umpositionieren und die resultierende Gesamtanordnung hinsichtlich einer funktionellen Rehabilitation bewerten. Aufgrund des in dieser Arbeit gewählten, physikalisch basierten Modellierungsansatzes kann unter Berücksichtigung des gesamten Weichgewebevolumens aus der Knochenverlagerung direkt die resultierende Gesichtsform berechnet werden. Dies wird anhand von 13 exemplarischen Fallstudien anschaulich demonstriert, wobei die Prognosequalität mittels postoperativer Fotografien und postoperativer CT-Daten überprüft und belegt wird. Die Arbeit wird mit einem Ausblick auf erweiterte Modellierungsansätze und einem Konzept für eine integrierte, klinisch einsetzbare Planungsumgebung abgeschlossen.

Description: In cranio-maxillofacial surgery, physicians are often faced with skeletal malformations that require complex bone relocations. Especially in severe cases of congenital dysgnathia (misalignment of upper and lower jaw) or hemifacial microsomia (asymmetric bone and tissue development), where multiple bone segments are to be mobilized and relocated simultaneously and in relation to each other, careful preoperative planning is mandatory. At present in clinical routine not all possible strategies can be planned and assessed with regard to functional rehabilitation. Moreover, the aesthetic outcome, i.e. the postoperative facial appearance, can only be estimated by a surgeon's experience and hardly communicated to the patient. On this account, a preoperative planning of complex osteotomies with bone relocations on a computerized model of a patient's head, including a reliable three-dimensional prediction and visualization of the post-surgical facial appearance is a highly appreciated possibility cranio-maxillofacial surgeons are longing for. This work, being performed at Zuse Institute Berlin (ZIB), addresses such a computer based 3D~surgery planning. A processing pipeline has been established and a simulation environment has been developed on basis of the software Amira, enabling a surgeon to perform bone cuts and bone rearrangements in an intuitive manner on virtual patient models. In addition, a prediction of the patients' postoperative appearance according to the relocated bone can be simulated and visualized realistically. For a meaningful planning of surgical procedures, anatomically correct patient models providing all relevant details are reconstructed from tomographic data with high fidelity. These patient models reliably represent bony structures as well as the facial soft tissue. Unstructured volumetric grids of the soft tissue are generated for a fast and efficient numerical solution of partial differential equations, describing tissue deformation on the foundation of 3D elastomechanics. The planning of osteotomies (bone cuts) for the mobilization and relocation of bone segments is performed in accordance to the planning on basis of life size replicas of a patient's skull, i.e. stereolitographic models. Osteotomy lines can be drawn on top of the polygonal planning models using suitable input devices. After evaluation of the consequence of a planned cut with regard to vulnerable inner structures (nerves, teeth etc.) the model is separated accordingly. A relocation of bone segments can be performed unrestrictedly in 3D or restricted to a translation or rotation within arbitrarily chosen planes under consideration of cephalometric guidelines. Bone and tooth collisions can be evaluated for functional analysis or orthodontic treatment planning with possible integration of digitized dental plaster casts. As a result of the preoperative planning, a single transformation matrix, encoding translation and rotation, or a sequence of such matrices are provided for each bone segment. Both the osteotomy paths and the transformation parameters can finally be used for intra-operative navigation. In the course of the planning, the relocated positions of bone segments serve as an input for the simulation of the resulting soft tissue deformation. Since bone and surrounding soft tissue share common boundaries that are either fixed or translocated, the resulting configuration of the entire tissue volume can be computed from the given boundary displacements by numerical minimization of the internal strain energy on basis of a biomechanical model, using a finite-element approach. In collaboration with different surgeons and hospitals more than 25 treatments have been accompanied by preoperative planning so far ranging from mandibular and midfacial hypoplasia to complex hemifacial microsomia. 13 of these cases are presented within this work. Simulation results were validated on the basis of photographs as well as of postoperative CT data, showing a good correlation between simulation and postoperative outcome. Further aspects of improving the modeling approach are discussed. It has been demonstrated that 3D~osteotomy planning on virtual patient models can be performed intuitively, and that 3D~tissue deformation for cranio-maxillofacial osteotomy planning can be predicted numerically without using heuristic ratios. It can be stated that by using 3D~planning software, a surgeon gains a better spatial understanding of complex dysplasia, and the 3D~soft tissue prediction gives an additional criterion for the assessment of the planned strategy. It turned out that, especially in complex cases such as hemifacial microsomia or for decisions bet­ween mono- and bimaxillary advancements, a 3D~planning aid is extremely helpful. The conclusion is, that images and animations created within the planning phase provide a valuable planning criterion for maxillofacial surgeons as well as a demonstrative information for patients and their relatives, thus greatly enhancing patient information, as well as surgical education. All data that result from the planning are also important for documentation and quality assurance. 3D osteotomy planning, including soft tissue prediction, likely will become a new paradigm of plastic and reconstructive surgery planning in the future. An assortment of results can be found under: http://www.zib.de/visual/medical/projects

Description: Multi-scale phenomena are abundant in many application fields. Representing and numerically simulating such processes is a challenging task since quite different scales have to be resolved, which often requires enormous amounts of storage and computational power. An important strategy in this context is adaptivity, i.e. local adjustment of the spatio-temporal resolution to the details to be resolved. A standard representation therefore are hierarchical, locally refined grids. A specific adaptive approach for solving partial differential equations, usually called AMR (Adaptive Mesh Refinement), was introduced in 1984. The basic idea is to combine the simplicity of structured grids and the advantages of local refinement. In this numerical scheme the computations are started on a set of coarse, potentially overlapping structured grids, that cover the computational domain. Local error criteria are applied to detect regions that require higher resolution. These are covered by subgrids with decreasing mesh spacing, which do not replace, but rather overlap the refined regions of the coarser patches. The equations are advanced on the finer subgrids and the refinement procedure recursively continues until all cells fulfill the considered error criteria, giving rise to a hierarchy of nested levels of refinement. In 1989 a variant of this scheme, called Structured Adaptive Mesh Refinement (SAMR), which reduces some of the complexity of the original approach, was proposed. While the separate subgrids in the AMR scheme could be rotated against each other, in SAMR they are aligned with the major axes of the coordinate system, which for example simplifies the computation of fluxes of (conserved) quantities through the cell faces. SAMR has become more and more popular in the last decade, and nowadays it is applied in many domains like hydrodynamics, meteorology and in particular in cosmology and relativistic astrophysics. Due to this growing popularity, an increasing number of scientists is in need of appropriate interactive visualization techniques to interpret and analyze AMR simulation data. Tools for both, 2D analysis to quantitatively convey the information within single slices and 3D representations to apprehend the overall structure are required. In this thesis we develop direct and indirect volume visualization algorithms for scalar fields that are defined on structured Adaptive Mesh Refinement (SAMR) grids. In particular algorithms for planar slicing and the display of height fields, C0-continuous isosurface extraction, software-, and hardware-based direct volume rendering and temporal interpolation for cell-, and vertex-centered data on unrestricted SAMR grids are proposed. Additionally we investigate the applicability of SAMR data structures for accelerated software-, and hardware-based volume rendering of large 3D scalar data.