Dr Thomas Kalinowski

Lecturer , Mathematics - School of Science and Technology

Thomas Kalinowski

Phone: +61 2 6773 5197

Email: tkalinow@une.edu.au

Qualifications

Diploma, PhD and Habilitation (Mathematics, University of Rostock, Germany)

Memberships

Deutsche Mathematiker Vereinigung (DMV)

Teaching Areas

I have taught a wide range of mathematics courses at the University of Rostock (Germany) and the University of Newcastle (Australia), in particular in the interface between discrete and combinatorial optimization and Operations Research.

Research Interests

I'm working in mathematical optimization in a variety of application contexts, such as the radiation therapy planning or supply chain logistics. This includes the development and analysis of algorithms using integer programming and combinatorial optimization, in particular network optimization. I am also interested in combinatorial and computational aspects of social choice theory.

Publications

Natashia Boland, Thomas Kalinowski, Fabian Rigterink:  A polynomially solvable case of the pooling problem, Journal of Global Optimization, 67, 621-630 (2017)

Natashia Boland, Santanu Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink: Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions, Mathematical Programming, 162, 523-535 (2017)

Natashia Boland, Thomas Kalinowski, Fabian Rigterink: New multi-commodity flow formulations for the pooling problem, Journal of Global Optimization, 66, 669-710 (2016)

Thomas Kalinowski, Uwe Leck, Christian Reiher, Ian T. Roberts: Minimizing the regularity of maximal regular antichains of 2- and 3-sets, Australasian Journal of Combinatorics, 64, 277-288 (2016)

Natashia Boland, Irina Dumitrescu, Gary Froyland, Thomas Kalinowski: Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming, Mathematical Programming, 157, 69-93 (2016)

Thomas Kalinowski, Dmytro Matsypura, Martin W.P. Savelsbergh: Incremental network design with maximum flows, European Journal of Operational Research, 242, 51-62 (2015)

Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng: Scheduling arc maintenance jobs in a network to maximize total flow over time, Discrete Applied Mathematics, 163, 34-52 (2014)

Matthew Baxter, Tarek Elgindy, Andreas T. Ernst, Thomas Kalinowski, Martin W.P. Savelsbergh: Incremental network design with shortest paths, European Journal of Operational Research, 238, 675-684, (2014)

Thomas Kalinowski, Uwe Leck, Ian T. Roberts: Maximal antichains of minimum size, Electronic Journal of Combinatorics, 20, 1-14 (2013)

Thomas Kalinowski: A Minimum Cost Flow Formulation for Approximated MLC Segmentation, Networks, 57, 135-140 (2011)

Martin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts: Maximal Flat Antichains of Minimum Weight, Electronic Journal of Combinatorics, 16, #R69 (2009)

Thomas Kalinowski: A Dual of the Rectangle-Segmentation Problem for Binary Matrices, Electronic Journal of Combinatorics, 16, #R89 (2009)

Thomas Kalinowski: A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint, Discrete Applied Mathematics, 152, 52-88 (2005)

Thomas Kalinowski: Reducing the number of monitor units in multileaf collimator field segmentation, Physics in Medicine and Biology, 50, 1147-1161 (2005)