Institute for Numerical and Applied Mathematics - Research Group Optimization

Profile of Jr.-Prof. Dr. Anja Fischer


 
Jr.-Prof. Dr. Anja Fischer
Institute for Numerical and Applied Mathematics
Lotzestraße 16-18
37083 Göttingen
Germany
 
Room 118
Telephone +49 (0)551-39-20035
a.fischer@math.uni-goettingen.de
 

Research Interests


 
  • Combinatorial Optimization, especially for problems with non-linearities
  • Polyhedral combinatorics
  • Semidefinite Optimization
  • Facility Layout Problems
  • Applications of integer programming in factory planning, logistics, mechanical engineering and bioinformatics

 

Scientific Vita


 
since July 2015 Juniorprofessor at the Institute for Numerical and Applied Mathematics, University of Göttingen
Aug. 2013 - June 2015 Postdoc at the Department of Mathematics at Technical University of Dortmund
July 2013 Promotion, grade: "summa cum laude"
Dissertation A Polyhedral Study of Quadratic Traveling Salesman Problems
Apr. 2009 - July 2013 Research assistant at the Department of Mathematics at Chemnitz University of Technology
At the Cluster of Excellence "Energy-Efficient Product and Process Innovations in Production Engineering" (eniPROD)
Oct. 2008 - March 2009 Research assistant at the Department of Computer Science at Chemnitz University of Technology
Sep. 2008 Assistant at the Department of Computer Science at Chemnitz University of Technology
June 2008 Diploma in Business Mathematics, grade: "Mit Auszeichung" (with distinction)
Diploma thesis Erstellen von wegeoptimierten Stundenplänen mit Diskreten Methoden
Oct. 2003 - July 2008 Studies of Business Mathematics (diploma), Chemnitz University of Technology
June 2003 Abitur, grade: 1,0
Aug. 1995 - June 2003 Albert-Schweitzer-Gymnasium Limbach-Oberfrohna

 

Activities


 
  • Member of the Simulation Science Center Clausthal-Göttingen
  • Junior Chair of the Special Interest Group in Optimization (SIGOPT)

 

Talks at Conferences and Workshops from 2013 to 2016


 
  • On the traveling salesman problem with forbidden neighborhoods.
    SIGOPT 2016 in Trier
  • Polynomial Matroid Optimisation Problems.
    Relaxation Workshop in Bonn
  • The Traveling Salesman Problem on Grids with Forbidden Neighborhoods.
    International Conference on Operations Research (OR 2015) in Vienna, Austria
  • Polyhedral Study of Linearizations of Polynomial Matroid Optimisation Problems.
    International Symposium on Mathematical Programming (ISMP 2015) in Pittsburgh, USA
  • Models for the Double-Row Equidistant Facility Layout Problem.
    International Conference on Operations Research (OR2014): Business Analytics and Optimization, Aachen.
  • A Polyhedral Study of Quadratic Traveling Salesman Problems.
    International Conference on Operations Research (OR2014): Business Analytics and Optimization, Aachen.
  • Matroid optimisation problems with some non-linear monomials in the objective function.
    Conference of the European Chapter on Combinatorial Optimization (ECCO 2014) in Munich
  • Mathematische Optimierung im Produktionsbereich.
    Conference ISINA 2014 in Chemnitz
  • Lifting clique tree inequalities for the quadratic traveling salesman problem.
    Colloquium on Combinatorics 2013 in Ilmenau
  • Two General Lifting Approaches for the Quadratic Traveling Salesman Problem.
    IFIP/TC 7 Conference 2013 in Klagenfurt, Austria
  • Vollständige Beschreibung bei der Optimierung über Matroide mit einem einzelnen quadratischen Monom.
    Workshop on Combinatorics, Graph Theory and Algorithms (SEG) in Mittweida
  • New lifting approaches for quadratic traveling salesman problems.
    Workshop Young Women in Discrete Mathematics in Bonn
  • Lifting approaches for quadratic traveling salesman problems.
    Workshop Optimization in Altenburg



Refereed journal publications




  • A. Fischer, F. Fischer. 2015. An extended approach for lifting clique tree inequalities. Journal of Combinatorial Optimization 30(3): 489-519.
  • A. Fischer, F. Fischer, G. Jäger, J. Keilwagen, P. Molitor, I. Grosse. 2015. Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. Computation 3(2): 285-298.
  • A. Fischer. 2014. An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope. SIAM Journal on Discrete Mathematics 28(1): 240-276.
  • A. Fischer, F. Fischer, G. Jäger, J. Keilwagen, P. Molitor, I. Grosse. 2014. Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. Discrete Applied Mathematics 166: 97-114.
  • A. Fischer, F. Fischer. 2013. Complete description for the spanning tree problem with one linearised quadratic term. Operations Research Letters 41(6): 701-705.
  • A. Fischer, C. Helmberg. 2013. The symmetric quadratic traveling salesman problem. Mathematical Programming 142(1): 205-254.



Submitted articles




  • O. Aichholzer, A. Fischer, F. Fischer, J.F. Meier, U. Pferschy, A. Pilz, R. Stan\vek. 2016. Minimization and Maximization Versions of the Quadratic Traveling Salesman Problem. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • M.F. Anjos, A. Fischer, P. Hungerländer. 2016. Solution Approaches for Equidistant Double- and Multi-Row Facility Layout Problems. Les Cahiers du GERAD.
  • A. Fischer, F. Fischer, S.T. McCormick. 2016. Matroid Optimisation Problems with Nested Non-linear Monomials in the Objective Function. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • A. Fischer, F. Fischer, P. Hungerländer. 2015. New exact approaches to row layout problems. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.



Download these publications as a single BibTeX-file: publications.bib