Dr Thomas Kalinowski
Lecturer
School of Mathematical and Physical Sciences
 Email:thomas.kalinowski@newcastle.edu.au
 Phone:(02) 4921 6558
Career Summary
Biography
Thomas Kalinowski received his PhD in mathematics in 2005 from the University of Rostock (Germany). His thesis under the supervision of Konrad Engel was on optimal treatment planning in radiation therapy. From 2005 to 2010 he worked as a lecturer of mathematics in Rostock, and from 2010 to 2012 as a research fellow in the group of Natashia Boland at the University of Newcastle (Australia). Since July 2013 he is a lecturer in mathematics in Newcastle.
Research ExpertiseI'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.
Teaching Expertise
I have taught a wide range of mathematics courses, but I'm specializing in the interface between discrete and combinatorial optimization and Operations Research.
Administrative Expertise
I'm currently member of the school committee for marketing and outreach.
Collaborations
I am collaborating with Natashia Boland, Konrad Engel, Uwe Leck, Ian Roberts, Martin Savelsbergh, Toby Walsh.
Qualifications
 PhD, Universitat Rostock
Keywords
 Combinatorics
 Discrete Mathematics
 Extremal graph theory
 Operations Research
 Optimization
Languages
 German (Fluent)
Fields of Research
Code  Description  Percentage 

010104  Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)  20 
010206  Operations Research  40 
010303  Optimisation  40 
Professional Experience
UON Appointment
Title  Organisation / Department 

Lecturer  University of Newcastle School of Mathematical and Physical Sciences Australia 
Academic appointment
Dates  Title  Organisation / Department 

1/03/2012  1/06/2013  Lecturer  University of Rostock Faculty of Science Australia 
1/01/2005  1/02/2010  Lecturer  University of Rostock Faculty of Science Australia 
Publications
For publications that are currently unpublished or inpress, details are shown in italics.
Chapter (1 outputs)
Year  Citation  Altmetrics  Link 

2010  Kalinowski T, 'Multileaf collimator field segmentation', Optimization in Medicine and Biology, Auerbach Publishers Inc., Pennsauken 253286 (2010) [B2] 
Journal article (23 outputs)
Year  Citation  Altmetrics  Link  

2016 
Boland N, Kalinowski T, Rigterink F, 'A polynomially solvable case of the pooling problem', Journal of Global Optimization, (2016)


2016 
Boland N, Dey S, Kalinowski T, Molinaro M, Rigterink F, 'Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions', Mathematical Programming, (2016)


2016  Kalinowski T, Leck U, Reiher C, Roberts IT, 'Minimizing the regularity of maximal regular antichains of 2 and 3sets', Australasian Journal of Combinatorics, 64 277288 (2016)  
2016 
Boland N, Dumitrescu I, Froyland G, Kalinowski T, 'Minimum cardinality nonanticipativity constraint sets for multistage stochastic programming', Mathematical Programming, 157 6993 (2016) [C1] Â© 2016, SpringerVerlag Berlin Heidelberg and Mathematical Optimization Society.We consider multistage stochastic programs, in which decisions can adapt over time, (i.e., at each... [more] Â© 2016, SpringerVerlag Berlin Heidelberg and Mathematical Optimization Society.We consider multistage stochastic programs, in which decisions can adapt over time, (i.e., at each stage), in response to observation of one or more random variables (uncertain parameters). The case that the time at which each observation occurs is decisiondependent, known as stochastic programming with endogeneous observation of uncertainty, presents particular challenges in handling nonanticipativity. Although such stochastic programs can be tackled by using binary variables to model the time at which each endogenous uncertain parameter is observed, the consequent conditional nonanticipativity constraints form a very large class, with cardinality in the order of the square of the number of scenarios. However, depending on the properties of the set of scenarios considered, only very few of these constraints may be required for validity of the model. Here we characterize minimal sufficient sets of nonanticipativity constraints, and prove that their matroid structure enables sets of minimum cardinality to be found efficiently, under general conditions on the structure of the scenario set.


2015 
Angelelli E, Kalinowski T, Kapoor R, Savelsbergh MWP, 'A reclaimer scheduling problem arising in coal stockyard management', Journal of Scheduling, (2015) Â© 2015 Springer Science+Business Media New YorkWe study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal... [more] Â© 2015 Springer Science+Business Media New YorkWe study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.


2015 
Kalinowski T, Matsypura D, Savelsbergh MWP, 'Incremental network design with maximum flows', European Journal of Operational Research, 242 5162 (2015) [C1] Â© 2014 Elsevier B.V. All rights reserved.We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and ... [more] Â© 2014 Elsevier B.V. All rights reserved.We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NPcomplete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics.


2015 
Boland N, Kalinowski T, Kaur S, 'Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period', Journal of Combinatorial Optimization, (2015) Â© 2015 Springer Science+Business Media New YorkWe study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node... [more] Â© 2015 Springer Science+Business Media New YorkWe study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maintenance on an arc shuts down the arc for the duration of the period in which its maintenance is scheduled, making its capacity zero for that period. A set of arcs is designated to have maintenance during the planning period, which will require each to be shut down for exactly one time period. In general this problem is known to be NPhard, and several special instance classes have been studied. Here we propose an additional constraint which limits the number of maintenance jobs per time period, and we study the impact of this on the complexity.


2015 
Boland N, Kalinowski T, Kaur S, 'Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies', Computers and Operations Research, 64 113129 (2015) [C1]


2014 
Boland N, Kapoor R, Kaur S, Kalinowski T, 'Scheduling Unit Time Arc Shutdowns to Maximize Network Flow Over Time: Complexity Results', NETWORKS, 63 196202 (2014) [C1]


2014 
Boland N, Kalinowski T, Waterer H, Zheng L, 'Scheduling arc maintenance jobs in a network to maximize total flow over time', DISCRETE APPLIED MATHEMATICS, 163 3452 (2014) [C1]


2014 
Baxter M, Elgindy T, Ernst AT, Kalinowski T, Savelsbergh MWP, 'Incremental network design with shortest paths', European Journal of Operational Research, (2014) [C1] We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network ... [more] We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, show that the simplest variant is NPhard, analyze the worstcase performance of natural greedy heuristics, derive a 4approximation algorithm, and conduct a small computational study. Â© 2014 Elsevier B.V. All rights reserved.


2013 
Kalinowski T, Leck U, Roberts IT, 'Maximal antichains of minimum size', Electronic Journal of Combinatorics, 20 114 (2013) [C1]


2013 
Boland N, Kalinowski T, Waterer H, Zheng L, 'Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain', JOURNAL OF SCHEDULING, 16 649659 (2013) [C1]


2005 
Kalinowski T, 'A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint', DISCRETE APPLIED MATHEMATICS, 152 5288 (2005)


2005 
Kalinowski T, 'Reducing the number of monitor units in multileaf collimator field segmentation', PHYSICS IN MEDICINE AND BIOLOGY, 50 11471161 (2005)


2000 
Kalinowski T, Schulz HJ, Briese M, 'Cooperation in the Minority Game with local information', PHYSICA A, 277 502508 (2000)


Boland N, Kalinowski T, Rigterink F, 'New multicommodity flow formulations for the pooling problem', Journal of Global Optimization,


Show 20 more journal articles 
Conference (15 outputs)
Year  Citation  Altmetrics  Link  

2015 
Boland N, Kalinowski T, Rigterink F, 'Discrete flow pooling problems in coal supply chains' (2015) [E1]


2015 
Boland N, Kalinowski T, Rigterink F, Savelsbergh M, 'A special case of the generalized pooling problem arising in the mining industry', ASOR Recent Advances in Operations Research (2015) [E3]


2013 
Kalinowski T, Narodytska N, Walsh T, Xia L, 'Strategic Behavior when Allocating Indivisible Goods Sequentially', Proceedings of the twentyseventh AAAI conference on artificial intelligence (2013) [E1]


2013 
Boland NL, Kaur S, Kalinowski T, Kapoor R, 'Scheduling unit processing time arc shutdown jobs to maximize network flow over time', Proceedings of the 49th ANZIAM Conference (2013) [E3]


2013 
Boland N, Ernst A, Kalinowski T, Rocha de Paula M, Savelsbergh M, Singh G, 'Time Aggregation for Network Design to Meet TimeConstrained Demand', MODSIM2013, 20th International Congress on Modelling and Simulation (2013) [E1]


2013  Gaspers S, Kalinowski T, Narodytska N, Walsh T, 'Coalitional manipulation for Schulze's rule', Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (2013) [E1]  
2013 
Kalinowski T, Narodytska N, Walsh T, 'A Social Welfare Optimal Sequential Allocation Procedure.', Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence (2013) [E1]


2012  Baxter M, Elgindy T, Ernst A, Kalinowski T, Savelsbergh MW, 'Incremental network design with shortest paths', 5th International Workshop on Freight Transportation and Logistics. Extended Abstracts (2012) [E3]  
2011 
Boland NL, Kalinowski T, Waterer H, Zheng L, 'An optimisation approach to maintenance scheduling for capacity alignment in the Hunter Valley coal chain', Proceedings of the 35th Application of Computers and Operations Research in the Minerals Industry Symposium (2011) [E1]


2006 
Kalinowski T, 'Optimization of MultiThreshold Circuits', Electronic Notes in Discrete Mathematics (2006)


2006  Engel K, Kalinowski T, Labahn R, Sill F, Timmermann D, 'Algorithms for leakage reduction with dual threshold design techniques', 2006 International Symposium on SystemonChip Proceedings (2006)  
2006 
Kalinowski T, 'Realization of intensity modulated radiation fields using multileaf collimators', General Theory of Information Transfer and Combinatorics (2006)


Show 12 more conferences 
Other (1 outputs)
Year  Citation  Altmetrics  Link  

2005 
Kalinowski T, 'Realization of intensity modulated radiation fields using multileaf collimator', ( pp.319320) (2005)

Report (1 outputs)
Year  Citation  Altmetrics  Link 

2013  Engel K, Kalinowski T, Savelsbergh MWP, 'Incremental Network Design with Minimum Spanning Trees.' (2013) 
Thesis / Dissertation (2 outputs)
Year  Citation  Altmetrics  Link 

2014  Kalinowski T, Kalinowski T, Applications of mathematical network theory, UniversitÃ¤t Rostock (2014)  
2005  Kalinowski T, Optimal multileaf collimator field segmentation, UniversitÃ¤t Rostock (2005) 
Grants and Funding
Summary
Number of grants  4 

Total funding  $1,533,159 
Click on a grant title below to expand the full details for that specific grant.
20143 grants / $973,159
Maintenance Optimisation in Rail Infrastructure Systems for Coal and Iron Ore Exports$560,000
Funding body: ARC (Australian Research Council)
Funding body  ARC (Australian Research Council) 

Project Team  Doctor Thomas Kalinowski, Professor Mathieu Savelsbergh, Professor Natashia Boland, Associate Professor Yangfeng Ouyang, Matt Dall, Steve Straughan, Scott Thomas 
Scheme  Linkage Projects 
Role  Lead 
Funding Start  2014 
Funding Finish  2017 
GNo  G1301225 
Type Of Funding  Aust Competitive  Commonwealth 
Category  1CS 
UON  Y 
Maintenance Optimisation in Rail Infrastructure Systems for Coal and Iron Ore Exports$408,159
Funding body: Aurizon Network Pty Ltd
Funding body  Aurizon Network Pty Ltd 

Project Team  Doctor Thomas Kalinowski, Professor Mathieu Savelsbergh, Professor Natashia Boland, Associate Professor Yangfeng Ouyang, Matt Dall, Steve Straughan, Scott Thomas 
Scheme  Linkage Projects Partner Funding 
Role  Lead 
Funding Start  2014 
Funding Finish  2017 
GNo  G1301276 
Type Of Funding  Grant  Aust Non Government 
Category  3AFG 
UON  Y 
Integrated network design and scheduling$5,000
Funding body: University of Newcastle
Funding body  University of Newcastle 

Project Team  Doctor Thomas Kalinowski 
Scheme  New Staff Grant 
Role  Lead 
Funding Start  2014 
Funding Finish  2014 
GNo  G1400299 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20111 grants / $560,000
Mathematics and Computing for Integrated Stockyardcentric Management of Mining Supply Chains$560,000
Funding body: ARC (Australian Research Council)
Funding body  ARC (Australian Research Council) 

Project Team  Doctor Thomas Kalinowski, Conjoint Professor Natashia Boland, Professor Peter Stuckey, Doctor Alexandre Mendes, Doctor Faramroze Engineer, Professor Martin Savelsbergh, Dr Andreas Ernst 
Scheme  Linkage Projects 
Role  Lead 
Funding Start  2011 
Funding Finish  2014 
GNo  G1000957 
Type Of Funding  Aust Competitive  Commonwealth 
Category  1CS 
UON  Y 
Research Supervision
Number of supervisions
Total current UON EFTSL
Current Supervision
Commenced  Level of Study  Research Title / Program / Supervisor Type 

2016  PhD 
Hamilton Cycles, Polytopes and Markov Chains PhD (Statistics), Faculty of Science and Information Technology, The University of Newcastle CoSupervisor 
2015  Masters 
Hsupermagic covering on some classes of graphs M Philosophy (Mathematics), Faculty of Science and Information Technology, The University of Newcastle Principal Supervisor 
2015  PhD 
Maintenance Optimisation in Rail Infrastructure Systems for Coal and Iron Ore Exports PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle Principal Supervisor 
2014  PhD 
Mathematics and Computing for Integrated Stockyardcentric Management of Mining Supply Chains PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle Principal Supervisor 
2014  PhD 
Graph Labeling and Application PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle CoSupervisor 
2014  PhD 
Conditional Resolvability of Graphs PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle CoSupervisor 
2014  PhD 
Power Domination in Graphs PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle CoSupervisor 
2011  PhD 
Integer Programming Heuristics PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle Principal Supervisor 
Past Supervision
Year  Level of Study  Research Title / Program / Supervisor Type 

2015  PhD 
Scheduling Problems Arising in Coal Export Supply Chains: Algorithms and Complexity PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle CoSupervisor 
2015  PhD 
Arc Shutdown Scheduling in a Capacitated Network to Maximize Flow Over Time PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle CoSupervisor 
Dr Thomas Kalinowski
Position
Lecturer
School of Mathematical and Physical Sciences
Faculty of Science and Information Technology
Contact Details
thomas.kalinowski@newcastle.edu.au  
Phone  (02) 4921 6558 
Fax  (02) 4921 6898 
Office
Room  V32 

Building  Mathematics building 
Location  Callaghan University Drive Callaghan, NSW 2308 Australia 