George White is currently an adjunct professor in the School of Information Technology and Engineering at the University of Ottawa. He obtained his BASc in engineering physics at the University of Toronto, and then a PhD at the University of Calgary. He has studied or worked at University College, Dublin, the University of Colorado at Boulder, and at L'institut National de Recherche en Informatique et en Automatique (INRIA) in France.

His research interests are in networks and in combinatorial optimization. He currently specializes in the heuristic optimization of nondeterministic polynomial time (NP) hard problems, such as those arising in resource allocation, routing, timetabling, and scheduling. He does work on contract, usually in C# or Java, for specific problems in these areas, and continues to perform research, work with graduate and undergraduate students at the university, and publish articles on heuristic optimization.

When he has the time, he writes book reviews and referees manuscripts for scientific journals and conferences. He enjoys playing with his grandchildren and, afterwards, recovering during a quiet evening at home with his wife, Julienne.

He keeps in touch with colleagues through conferences and through his position as treasurer of the retired professors association of the University of Ottawa.

Read our Q&A with George White here.