08+09S 09W 10S,W 11S,W 12S,W 13S,W 14S,W 15S,W 16S,W 17S,W 18S,W 19S,W 20S,W 21S,W 22S,W 23S,W 24S,W 25S
| Summer Term 2013, Doctoral School Events | |
| 2013-05-03 | Doctoral School Seminar (Inst. Mathematik, Heinrichstr. 36, HS 11.02. 15:00—17:30, KFU) |
| Marko Raseta (TU, advisor I. Berkes): Trigonometric series with random frequencies [show abstract] | |
| Rohmatul Fajriyah (TU, advisor I. Berkes): A study of convolution models for background correction of bead arrays [show abstract] | |
| Renier Mendoza (KFU, advisor S. Keeling): Heuristic and multi-phase segmentation approaches to the electrical impedance tomography problem [show abstract] | |
| Fabrizio Barroero (TU, advisor R. Tichy): Counting points of fixed degree and bounded height [show abstract] | |
| 2013-05-17 | Doctoral School Seminar (Seminarraum 2 des Instituts für Geometrie, Kopernikusgasse 24, 10:30—13:00, TU) |
| Chanwit Prabpayak (KFU, advisor G. Lettl): Orders in purely cubic number fields [show abstract] | |
| Alina Bazarova (TU, advisor I. Berkes): Extremal theory of dependent processes [show abstract] | |
| Arno Kimeswenger (TU, advisor O. Steinbach): Boundary Control of Exterior Boundary Value Problems [show abstract] | |
| Elias Karabelas (TU, advisor O. Steinbach): Space-Time Discontinuous Galerkin Methods for Solving Semilinear Parabolic Partial Differential Equations [show abstract] | |
| 2013-06-21 | Doctoral School Seminar (Inst. Mathematik, Heinrichstr. 36, HS 11.02. 15:00—17:30, KFU) |
| Rostislav Stanek (TU, advisor E. Dragoti-Cela): Using pure integer solutions to solve the traveling salesman problem | |
|
Abstract: Given a complete graph G = (V, E) and weights w: E(G) → (0,∞), the Traveling Salesman Problem asks for a shortest tour with respect to the weights w. There are many approaches to solve this problem to optimality. Usually the integrality constraints are relaxed first and all separation processes are done on fractional solutions. In our approach we never interfere with fractional solutions but leave those to the ILP-solver. We relax the subtour constraints only, solve the problem to the optimality, add the violated constraints and repeat the process until a feasible solution is found. Further, in order to speed up the algorithm, we introduce more preprocessing strategies which find some of the needed subtour inequalities. Finally, we present some computational results. [hide abstract] | |
| Tang Quoc Bao (KFU, advisor K. Fellner): Existence and convergence to equilibrium of a class of reaction diffusion systems [show abstract] | |
| Dexter J. Indong (KFU, advisor F. Kappel): Sensitivity analysis of a malaria transmission model [show abstract] | |
| Carl Trautmann (KFU, advisor K. Kunisch): Sparse optimal controls for the linear wave equation [show abstract] | |
| 2013-07-05 | Doctoral School Seminar (Seminarraum 2 des Instituts für Geometrie, Kopernikusgasse 24, 12:00—13:00, TU) |
| Dijana Kreso (TU, advisor R. Tichy): Invariants of polynomial decomposition [show abstract] | |
| Florian Greinecker (P. Grabner, advisor TU): On the Distribution of Stirling Numbers modulo Primes [show abstract] |