Dr. Imke Joormann


Email:   joormann [at] mathematik.tu-darmstadt.de 
Office:  S4|10 26a

Phone: +49 (0)6151 / 16-23437

Office Hours:

Semester Break: by appointment

Lecture Period: Thursday, 13:30 - 14:30, and by appointment


  • Mixed integer linear programming (MILP)
  • Infeasible models
  • Gas network optimization
  • Parameterized complexity

Finished Projects



A python package that computes Irreducible Infeasible Subsystem Arc Covers in Flow Networks; included is a generator for infeasible network flow problems.

Data Bases

  • Testset with 100 infeasible network flow problems (tar.gz) (zip).
  • Some realistic gas transport networks can be found in the gaslib.

Paper / Preprints

  • I. Joormann and M.E. Pfetsch, Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks, Tech. Rep. Submitted. (Preprint)
  • I. Joormann and M.E. Pfetsch, On the Relation of Flow Cuts and Irreducible Infeasible Subsystems, Tech. Rep. Submitted. (Preprint)
  • I. Joormann, M. Schmidt, M.C. Steinbach, and B.M. Willert, What does "feasible" mean? in Evaluating Gas Network Capacities, ser. MOS-SIAM Series on Optimization, T. Koch, B.Hiller, M.E. Pfetsch, and L. Schewe, Eds.  SIAM, 2015, ch. 11, pp. 211-232.


  • PhD Thesis: Analyzing Infeasibility in Network Flows, supervised by M.E. Pfetsch.
    ISBN 978-3-8439-2410-8
  • Diploma Thesis: Sortierung von Güterwagen in Gruppen beliebiger Reihenfolge (Sorting of Rolling Stock in Groups of Arbitrary Order), supervised by U. Zimmermann

Lecture Assistance


Imke Joormann

Research Group Optimization
Dolivostr. 15
64293 Darmstadt

A A A | Print Drucken | Impressum Impressum | Contact Kontakt
    zum Seitenanfangzum Seitenanfang