Packing and high-multiplicity problems
Approximation algorithms for packing problems, especially settings where many objects can be grouped into a small number of types.
Assistant Professor of Computer Science
Andrew Bloch-Hansen
I am an Assistant Professor in the Department of Mathematics and Computing at Mount Royal University in Calgary, Alberta. I also hold an appointment as an Adjunct Research Professor at Western University.
About
My work is centered on the design and analysis of efficient algorithms for difficult optimization problems.
My research focuses on algorithms, approximation algorithms, and combinatorial optimization. I design and analyze algorithms for hard optimization problems, such as packing, routing, and clustering problems.
My research program focuses on designing and analyzing efficient approximation algorithms for resource allocation problems. I develop polynomial-time approximation algorithms and approximation schemes that provide mathematically guaranteed bounds on solution quality.
Research interests
I study optimization problems where exact solutions are computationally difficult, and I design algorithms with provable performance guarantees.
Routing with resource constraints
Algorithms for routing problems that combine path selection with knapsack-style decisions, including the thief orienteering problem.
Clustering and neural approaches
Algorithmic and experimental approaches to clustering problems such as k-median, including local search and neural-network-inspired algorithms.
Current Projects
Neural networks for the k-median problem
Experimental evaluation of algorithms for the thief-orienteering problem
Transformations of special graph classes for ThOP to DAGs
Multi-trip capacitated prize-collecting vehicle routing problem with depot release dates
Improving student mastery of air traffic control communication through mobile simulation-based learning
Current Projects
Justina Saccomani
Ayla Ventura
Yacob Mesfun
Yanishka Gahlot
Lorenzo Primiterra
Andrew Krawiec
Nour Farid Jabr Fayadh
Selected publications
A selection of recent work on approximation algorithms, packing, thief orienteering, and clustering.
A Resonance Neural Network for the K-Median Problem
Conference on Algorithms and Discrete Applied Mathematics. Springer Nature Switzerland, 2026.
LinkThe Thief Orienteering Problem on 2-Terminal Series-Parallel Graphs
Acta Informatica 62.2 (2025): 18.
LinkHigh Multiplicity Strip Packing with Three Rectangle Types
Theory of Computing Systems 69.2 (2025): 17.
LinkAlgorithms for the Thief Orienteering Problem on Directed Acyclic Graphs
Theoretical Computer Science 1023 (2025): 114900.
LinkTeaching
At Mount Royal University, I teach the core data structures and algorithms courses across all four years of the computer science undergraduate program. I recently designed a new fourth-year algorithms course that is being offered in Winter 2027.
Introduction to Computer Science II
Introduction to object-oriented analysis and design, programming using an object-oriented language, and implementation of linked data structures. Issues of modularity, software design, and programming style are emphasized.
Information Structures I
Data structures important to computer science are studied, including trees, graphs, and hash tables. Searching and sorting techniques are emphasized, along with associated algorithms and their time and space efficiency.
Algorithms and Complexity
The design of algorithms and the analysis of their efficiency. Greedy algorithms, divide-and-conquer strategies, recursive backtracking, and dynamic programming are studied. Heuristic algorithms and NP-completeness are introduced.
Algorithms II
This course explores advanced algorithmic techniques for solving complex optimization problems. Topics include flow networks, approximation algorithms for NP-hard combinatorial problems, randomized algorithms, and online algorithms.
Research with students
I am always looking for motivated undergraduate students interested in algorithms and combinatorial optimization. If you are interested in a research project, please email me with your resume, your transcript, and a brief description of your background.
Contact
Department of Mathematics and Computing, Mount Royal University.
Mount Royal University
Assistant Professor of Computer Science
Department of Mathematics and Computing
Calgary, Alberta, Canada