Profile Image

Dr Thomas Kalinowski

Lecturer

School of Mathematical and Physical Sciences

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 Expertise
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.

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

CodeDescriptionPercentage
010104Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)20
010206Operations Research40
010303Optimisation40

Professional Experience

UON Appointment

DatesTitleOrganisation / Department
22/07/2014 - LecturerUniversity of Newcastle
School of Mathematical and Physical Sciences
Australia
1/03/2011 - 29/02/2012Research FellowUniversity of Newcastle
School of Mathematical and Physical Sciences
Australia

Academic appointment

DatesTitleOrganisation / Department
1/03/2012 - 1/06/2013LecturerUniversity of Rostock
Faculty of Science
Australia
1/01/2005 - 1/02/2010LecturerUniversity of Rostock
Faculty of Science
Australia
Edit

Publications

For publications that are currently unpublished or in-press, details are shown in italics.


Chapter (1 outputs)

YearCitationAltmetricsLink
2010Kalinowski T, 'Multileaf collimator field segmentation', Optimization in Medicine and Biology, Auerbach Publishers Inc., Pennsauken 253-286 (2010) [B2]

Journal article (20 outputs)

YearCitationAltmetricsLink
2015Kalinowski T, Matsypura D, Savelsbergh MWP, 'Incremental network design with maximum flows', European Journal of Operational Research, 242 51-62 (2015)

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 NP-complete 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.

DOI10.1016/j.ejor.2014.10.003
CitationsScopus - 2Web of Science - 2
2015Kalinowski T, Matsypura D, Savelsbergh MWP, 'Incremental network design with maximum flows', European Journal of Operational Research, 242 51-62 (2015)
DOI10.1016/j.ejor.2014.10.003
2015Boland 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)
DOI10.1007/s10878-015-9910-x
Co-authorsNatashia Boland
2015Boland 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)

We 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 NP-hard, 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.

DOI10.1007/s10878-015-9910-x
Co-authorsNatashia Boland
2015Angelelli E, Kalinowski T, Kapoor R, Savelsbergh MWP, 'A reclaimer scheduling problem arising in coal stockyard management', Journal of Scheduling, (2015)
DOI10.1007/s10951-015-0436-y
2015Boland 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 & Operations Research, (2015)
DOI10.1016/j.cor.2015.05.011
2014Boland N, Kapoor R, Kaur S, Kalinowski T, 'Scheduling Unit Time Arc Shutdowns to Maximize Network Flow Over Time: Complexity Results', NETWORKS, 63 196-202 (2014) [C1]
DOI10.1002/net.21536Author URL
Co-authorsNatashia Boland
2014Boland N, Kalinowski T, Waterer H, Zheng L, 'Scheduling arc maintenance jobs in a network to maximize total flow over time', DISCRETE APPLIED MATHEMATICS, 163 34-52 (2014) [C1]
DOI10.1016/j.dam.2012.05.027Author URL
CitationsWeb of Science - 1
Co-authorsHamish Waterer, Natashia Boland
2014Baxter 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 design problem with shortest paths. We investigate structural properties of optimal solutions, show that the simplest variant is NP-hard, analyze the worst-case performance of natural greedy heuristics, derive a 4-approximation algorithm, and conduct a small computational study. © 2014 Elsevier B.V. All rights reserved.

DOI10.1016/j.ejor.2014.04.018
CitationsScopus - 4Web of Science - 4
2013Kalinowski T, Leck U, Roberts IT, 'Maximal antichains of minimum size', Electronic Journal of Combinatorics, 20 1-14 (2013) [C1]
2013Boland N, Kalinowski T, Waterer H, Zheng L, 'Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain', JOURNAL OF SCHEDULING, 16 649-659 (2013) [C1]
DOI10.1007/s10951-012-0284-yAuthor URL
CitationsScopus - 1
Co-authorsHamish Waterer, Natashia Boland
2011Kalinowski T, 'A Minimum Cost Flow Formulation for Approximated MLC Segmentation', NETWORKS, 57 135-140 (2011) [C1]
DOI10.1002/net.20394Author URL
CitationsScopus - 1Web of Science - 1
2009Kalinowski T, Kiesel A, 'Approximated MLC shape matrix decomposition with interleaf collision constraint.', Algorithmic Operations Research, 4 49-57 (2009) [C1]
2009Gruettmueller M, Hartmann S, Kalinowski T, Leck U, Roberts IT, 'Maximal flat antichains of minimum weight', ELECTRONIC JOURNAL OF COMBINATORICS, 16 (2009) [C1]
Author URL
CitationsScopus - 4Web of Science - 1
2009Kalinowski T, 'A dual of the rectangle-segmentation problem for binary matrices', ELECTRONIC JOURNAL OF COMBINATORICS, 16 (2009) [C1]
Author URL
CitationsScopus - 2Web of Science - 1
2008Kalinowski T, 'Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition.', Algorithmic Operations Research, 3 165-174 (2008) [C1]
2005Kalinowski T, 'A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint', DISCRETE APPLIED MATHEMATICS, 152 52-88 (2005)
DOI10.1016/j.dam.2004.10.008Author URL
CitationsScopus - 21Web of Science - 23
2005Kalinowski T, 'Reducing the number of monitor units in multileaf collimator field segmentation', PHYSICS IN MEDICINE AND BIOLOGY, 50 1147-1161 (2005)
DOI10.1088/0031-9155/50/6/008Author URL
CitationsScopus - 10Web of Science - 10
2004Kalinowski T, 'A recolouring problem on undirected graphs', Rostock. Math. Kolloq., 58 27-30 (2004)
2000Kalinowski T, Schulz HJ, Briese M, 'Cooperation in the Minority Game with local information', PHYSICA A, 277 502-508 (2000)
DOI10.1016/S0378-4371(99)00553-1Author URL
CitationsScopus - 41Web of Science - 37
Show 17 more journal articles

Conference (13 outputs)

YearCitationAltmetricsLink
2013Kalinowski T, Narodytska N, Walsh T, Xia L, 'Strategic Behavior when Allocating Indivisible Goods Sequentially', Proceedings of the twenty-seventh AAAI conference on artificial intelligence, Bellevue, Washington, USA (2013) [E1]
CitationsScopus - 1
2013Boland 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, Newcastle, NSW (2013) [E3]
Co-authorsNatashia Boland
2013Boland N, Ernst A, Kalinowski T, Rocha de Paula M, Savelsbergh M, Singh G, 'Time Aggregation for Network Design to Meet Time-Constrained Demand', MODSIM2013, 20th International Congress on Modelling and Simulation, Adelaide, SA (2013) [E1]
Co-authorsMateus Rochadepaula, Natashia Boland
2013Gaspers 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, Saint Paul, Minnesota (2013) [E1]
2013Kalinowski T, Narodytska N, Walsh T, 'A Social Welfare Optimal Sequential Allocation Procedure.', Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, Beijing, China (2013) [E1]
CitationsScopus - 1
2012Kalinowski T, Narodytska N, Walsh T, Xia L, 'Elicitation-free Protocols for Allocating Indivisble Goods', Fourth International Workshop on Computational Social Choice, Krakow, Poland (2012) [E1]
2012Baxter 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, Mykonos, Greece (2012) [E3]
2011Boland 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, Wollongong, NSW (2011) [E1]
CitationsScopus - 1
Co-authorsNatashia Boland, Hamish Waterer
2009Kalinowski T, 'The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence', Discrete Applied Mathematics, Univ Rostock, Rostock, GERMANY (2009) [E1]
DOI10.1016/j.dam.2008.06.027
CitationsScopus - 8Web of Science - 8
2008Kalinowski T, Engel K, Kiesel A, 'Discrete Optimization Problems for Radiation Therapy Planning', Les Annales ROAD, Algiers (2008) [E2]
2006Kalinowski T, 'Optimization of Multi-Threshold Circuits', Electronic Notes in Discrete Mathematics (2006)
DOI10.1016/j.endm.2006.08.052
2006Engel K, Kalinowski T, Labahn R, Sill F, Timmermann D, 'Algorithms for leakage reduction with dual threshold design techniques', 2006 International Symposium on System-on-Chip Proceedings, Tampere, FINLAND (2006)
Author URL
2006Kalinowski T, 'Realization of intensity modulated radiation fields using multileaf collimators', General Theory of Information Transfer and Combinatorics, Univ Bielefeld, Bielefeld, GERMANY (2006)
Author URL
CitationsScopus - 9Web of Science - 8
Show 10 more conferences

Other (1 outputs)

YearCitationAltmetricsLink
2005Kalinowski T, 'Realization of intensity modulated radiation fields using multileaf collimator', ( pp.319-320) (2005)
DOI10.1016/j.endm.2005.07.074

Report (2 outputs)

YearCitationAltmetricsLink
2013Boland 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.' (2013)
Co-authorsNatashia Boland
2013Engel K, Kalinowski T, Savelsbergh MWP, 'Incremental Network Design with Minimum Spanning Trees.' (2013)

Thesis / Dissertation (2 outputs)

YearCitationAltmetricsLink
2014Kalinowski T, Kalinowski T, Applications of mathematical network theory, Universität Rostock (2014)
2005Kalinowski T, Optimal multileaf collimator field segmentation, Universität Rostock (2005)
Edit

Grants and Funding

Summary

Number of grants3
Total funding$1,125,000

Click on a grant title below to expand the full details for that specific grant.


20142 grants / $565,000

Maintenance Optimisation in Rail Infrastructure Systems for Coal and Iron Ore Exports$560,000

Funding body: ARC (Australian Research Council)

Funding bodyARC (Australian Research Council)
Project TeamDoctor Thomas Kalinowski, Professor Mathieu Savelsbergh, Professor Natashia Boland, Associate Professor Yangfeng Ouyang, Matt Dall, Steve Straughan, Scott Thomas
SchemeLinkage Projects
RoleLead
Funding Start2014
Funding Finish2014
GNoG1301225
Type Of FundingAust Competitive - Commonwealth
Category1CS
UONY

Integrated network design and scheduling$5,000

Funding body: University of Newcastle

Funding bodyUniversity of Newcastle
Project TeamDoctor Thomas Kalinowski
SchemeNew Staff Grant
RoleLead
Funding Start2014
Funding Finish2014
GNoG1400299
Type Of FundingInternal
CategoryINTE
UONY

20111 grants / $560,000

Mathematics and Computing for Integrated Stockyard-centric Management of Mining Supply Chains$560,000

Funding body: ARC (Australian Research Council)

Funding bodyARC (Australian Research Council)
Project TeamDoctor Thomas Kalinowski, Conjoint Professor Natashia Boland, Professor Peter Stuckey, Doctor Alexandre Mendes, Doctor Faramroze Engineer, Conjoint Professor Martin Savelsbergh, Dr Andreas Ernst
SchemeLinkage Projects
RoleLead
Funding Start2011
Funding Finish2011
GNoG1000957
Type Of FundingAust Competitive - Commonwealth
Category1CS
UONY
Edit

Research Supervision

Current Supervision

CommencedResearch Title / Program / Supervisor Type
2014Mathematics and Computing for Integrated Stockyard-centric Management of Mining Supply Chains
Mathematics, Faculty of Science and Information Technology
Principal Supervisor
2011Scheduling Problems Arising in Coal Export Supply Chains: Algorithms and Complexity
Mathematics, Faculty of Science and Information Technology
Co-Supervisor
2011Arc Shutdown Scheduling in a Capacitated Network to Maximize Flow Over Time
Mathematics, Faculty of Science and Information Technology
Co-Supervisor
2011Integer Programming Heuristics
Mathematics, Faculty of Science and Information Technology
Principal Supervisor
Edit

Dr Thomas Kalinowski

Position

Lecturer
School of Mathematical and Physical Sciences
Faculty of Science and Information Technology

Contact Details

Emailthomas.kalinowski@newcastle.edu.au
Phone(02) 4921 6558
Fax(02) 4921 6898

Office

RoomV32
BuildingMathematics building
LocationCallaghan
University Drive
Callaghan, NSW 2308
Australia
Edit