Research

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. 

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.

Andrew Bloch-Hansen, Cody Rossiter, and Roberto Solis-Oba. "A Resonance Neural Network for the K-Median Problem." Conference on Algorithms and Discrete Applied Mathematics. Cham: Springer Nature Switzerland, 2026. Link

Andrew Bloch-Hansen and Roberto Solis-Oba. "The Thief Orienteering Problem on 2-Terminal Series-Parallel Graphs." Acta Informatica 62.2 (2025):18. Link 

Andrew Bloch-Hansen, Roberto Solis-Oba, and Andy Yu. "High Multiplicity Strip Packing with Three Rectangle Types." Theory of Computing Systems 69.2 (2025): 17. Link 

Andrew Bloch-Hansen, Roberto Solis-Oba, and Daniel R. Page. "Algorithms for the Thief Orienteering Problem on Directed Acyclic Graphs." Theoretical Computer Science 1023 (2025): 114900. Link