Research Areas
My research spans combinatorial optimization, optimization under uncertainty, and sequential decision making. Recently, my work has been motivated by the challenges in three broad areas:- Coupled Dynamic Systems. In many settings, multiple interconnected components evolve stochastically over time and compete for shared resources, such as managing inventory across a supply network, allocating capacity across hospital units, or coordinating service levels across locations. Because decisions in one part of the system affect outcomes elsewhere, there is an inherent tradeoff between system complexity to enforce coordination, and the need for tractable models that can be solved efficiently. My research investigates structural properties for coupled systems, exact methods, and approximation techniques that retain strong theoretical guarantees on performance.
- Leveraging Structure-aware Data in Combinatorial Optimization. I have been one of the pioneers in designing network and decision-diagram formulations for optimization and stochastic optimization problems. The fundamental idea is to leverage structure in instance-specific settings to transform complex combinatorial constraints into tractable representations, while preserving tractability or strong bounds on solution quality. This approach has led to significant advances in both theory and practice, providing scalable solutions for previously intractable domains.
- Applications in Supply Chains and Healthcare. I apply these methodological advances to operational systems where resource coupling and uncertainty are central, informing capacity planning, allocation, scheduling, and system design decisions.
Publications
Working Papers
Delayed Allocation in Marginalized Flow Models for Weakly Coupled Markov Decision Processes
Working Paper
[HTML]
Network Relaxations for Combinatorial Bilevel Optimization under Linear Interactions
Working Paper
[HTML]
Assortment Optimization without Prediction: An End-to-end Framework with Transaction Data
Working Paper
[HTML]
Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
Working Paper
[HTML]
Journal Papers
The Sensitivity of the US Presidential Election to Coordinated Voter Relocation
INFORMS Journal on Computing, forthcoming 2026
[HTML]
Design and Analysis of Efficient Sequencing Policies for Linear Cold Storage Devices
Production and Operations Management, 2025
[HTML]
Memory-efficient Sequential Pattern Mining with Hybrid Tries
Journal of Machine Learning Research, 2025
[HTML]
Self-Adapting Network Relaxations for Weakly Coupled Markov Decision Processes
Management Science, 2024
[HTML]
Decentralized Online Order Fulfillment in Omni-Channel Retailers
Production and Operations Management, 2023
[HTML]
Multistage Fractionated Intensity Modulated Radiation Therapy Planning
Computers & Operations Research, 2023
[HTML]
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
INFORMS Journal on Computing, 2022
[HTML]
A Combinatorial Cut-and-Lift Procedure with an Application to 0-1 Second-Order Conic Programming
Mathematical Programming, 2022
[HTML]
Dynamic Scheduling of Home Care Patients to Medical Providers
Production and Operations Management, 2022
[HTML]
Network-Based Approximate Linear Programming for Discrete Optimization
Operations Research, 2020
[HTML]
An MDD-based Lagrangian Approach to the Multi-Commodity Pickup-and-Delivery TSP
INFORMS Journal on Computing, 2020
[HTML]
Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics
Journal of Artificial Intelligence Research, 2020
[HTML]
Integrated Integer Programming and Decision Diagram Search Tree with an Application to the Maximum Independent Set Problem
Constraints, 2020
[HTML]
A Network-Based Formulation for Scheduling Clinical Rotations
Production and Operations Management, 2019
[HTML]
Hybrid Optimization Methods for Time-Dependent Sequencing Problems
European Journal of Operational Research, 2017
[HTML]
Modeling with Metaconstraints and Semantic Typing of Variables
INFORMS Journal on Computing, 2016
[HTML]
Logic-based Benders Decomposition for Planning and Scheduling: A Computational Analysis
Knowledge Engineering Review, 2016
[HTML]
Theoretical Insights and Algorithmic Tools for Decision Diagram-based Optimization
Constraints, 2016
[HTML]
Planning the Operation of a Large Real-World Oil Pipeline
Computers & Chemical Engineering, 2012
[HTML]
Books
Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 20th International Conference (CPAIOR 2023)
Springer Nature, 2023
[HTML]
Peer-Reviewed Conference Proceedings
Minimizing Effort and Risk with Network Change Deployment Planning
IFIP Networking Conference, 2021
[HTML]
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
AAAI, 2021
[HTML]
Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation
ICAPS, 2019
[HTML]
Mixed Integer Programming vs. Logic-based Benders Decomposition for Planning and Scheduling
CPAIOR, 2013
[HTML]
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem
CPAIOR, 2012
[HTML]
Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events
IJCAI, 2009
[PDF]
Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem
CSE, 2008
[HTML]