Reshma Chirayil Chandrasekharan completed her PhD in Industrial Engineering from the department of Computer Science, KU Leuven, Belgium in 2021. Her current research interests broadly lie in designing decomposition based algorithms for large combinatorial optimization problems. Specifically she is interested in matheuristics, a class of algorithms that hybridize Mathematical Programming and heuristics. She has been able to apply her research in applications such as sports scheduling, personnel scheduling and also in more general problems such as the graph vertex coloring problem. She holds a BSMS dual degree in Science from IISER, Pune India and believes in inquiry based learning. She aspires to be a versatile educator and likes collaborating with industry and working on inter-disciplinary projects.
Decomposition-based techniques for very large combinatorial optimization prioblems, matheuristics, graph vertex coloring, personnel scheduling
Chandrasekharan, R. C., Wauters, T., A constructive matheuristic approach for the graph vertex coloring problem
- PhD (2016-2021), Dept. of Computer Science, KU Leuven, Belgium.
- BS MS dual degree (2010 – 2015), Indian Institute of Science Education and Research (IISER) Pune, India