Kontakt

Technische Universität Dortmund
Fakultät für Mathematik
Vogelpothsweg 87
44227 Dortmund
Germany

Email: Frank Baumann

Interessengebiete

• MINLP (Mixed-Integer Nonlinear Programming)
• Integer Linear and Polynomial Programming
• Combinatorial Optimization
• Robust Optimization

Projekte

• Lenkung des Güterflusses in durch Gateways gekoppelten Logistik-Service-Netzwerken mittels quadratischer Optimierung
• SCIL – Symbolic Constraints for Integer Linear Programming
• ABACUS

Veröffentlichungen

Buchkapitel

• Exact Algorithms for Combinatorial Optimization Problems with Submodular Objective Functions
  In: M. Jünger and G. Reinelt, Facets of Combinatorial optimization, pp 271–294, Springer 2013 (preprint)
  (with S. Berckey and C. Buchheim)

Konferenzbeiträge

• Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
  International Symposium on Combinatorial Optimization – ISCO 2014, pp 62–74 (2014) (preprint)
  (with C. Buchheim and A. Ilyina)


• Quadratic Models for Hub-Location Problems revisited
  Proceedings of VEROLOG 2012 - First meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization
  pp 22–23 (2012)
  (with J. Baudach, C. Buchheim, U. Clausen and F. Meier)


• Submodular Formulations for Range Assignment Problems
  International Symposium on Combinatorial Optimization – ISCO 2010,
  Electronic Notes in Discrete Mathematics 36, pp 239–246 (2010)
  (with C. Buchheim)


• Exact Bipartite Crossing Minimization under Tree Constraints
  9th International Symposium on Experimental Algorithms – SEA 2010,
  LNCS 6049, pp 118–128 (2010)
  (with C. Buchheim and F. Liers)


• Exact Bipartite Crossing Minimization under Tree Constraints
  9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
  Extended Abstracts, pp 17–20 (2010)
  (with C. Buchheim and F. Liers)

Preprints

• A Lagrangean Decomposition Approach for Robust Combinatorial Optimization.
  Technical Report, Optimization Online (2014)
  (with C. Buchheim and A. Ilyina)


• Complexity and Exact Solution Approaches to the Minimum Changeover Cost Arborescence Problem
  Technical Report, Optimization Online (2013)
  (with S. Gualandi, G. Galbiati and E. Traversi)