Dr Kevin White

Highlights

For my successful candidature for the degree of Doctor of Philosophy, I studied Ground Holding Optimisation and Air Schedule Recovery under the supervision of Professor Jerzy Filar.

(See Ground holding optimisation and air schedule recovery / Kevin White online at the UniSA library.)

From 2002 until 2007, I led projects on scheduling of trains on longhaul networks for the Cooperative Research Centre for Railway Engineering and Technologies.

University of SA Supported Researcher, 2003 - 2010.

My Erdős number is three.

Teaching strengths

• Discrete Optimisation

Highlights

Calculus and Linear Algebra, and their applications. Optimisation, particularly the Discrete kind.

Supervision of Honours and Final Year Projects. I have supervised many student projects, most of them in the broad area of Combinatorial Optimisation.For example, a recent project studied domination in graphs.

Honours Projects currently available.

Combinatorial Optimisation: Optimisation problems in which the feasible solutions are naturally integer valued or come from some other discrete set are referred to as combinatorial. Some of them, like the minimal spanning tree, are very easy to solve and some, like the celebrated travelling salesperson, are quite difficult. The problems give rise to many interesting solution techniques involving combinatorics, linear programming and primal-dual methods, and lean on properties like complexity of algorithms and unimodularity of matrices. According to the student’s interest, this project could focus on a particular problem or class of problems, or on a particular solution technique.