Combinatorial Optimization — Selected Works

Overview

Combinatorial optimization underpins routing, scheduling, assignment, packing and resource-allocation systems. This research develops learning-based optimizers that complement exact mathematical programming and hand-crafted heuristics with evolutionary learning, genetic programming, neural solvers and large language models. The goal is to create solvers that adapt to dynamic environments, generalize across problem variants, remain robust under distribution shift and scale to industrial problem sizes.

Vehicle routingDynamic schedulingGenetic programmingNeural combinatorial optimizationReinforcement learningLLMs for optimization

Research Directions

Keynotes

Selected Publications