Operations Research

Stochastic Dynamic Programming Algorithms

Development of advanced dynamic programming techniques for solving multi-stage stochastic optimization problems with high-dimensional state spaces and uncertainty.

RESEARCH GAP FRONTIERS

Machine Learning Integrated Optimization

Integration of neural networks and machine learning models with classical optimization algorithms to solve complex combinatorial and continuous problems.

RESEARCH GAP FRONTIERS

Robust Optimization Under Uncertainty

Development of decision-making frameworks that maintain feasibility and near-optimality across uncertain parameter sets without probabilistic distributions.

RESEARCH GAP FRONTIERS

Distributed Optimization Networks

Design of decentralized algorithms for multi-agent systems to achieve global optimization objectives through local computation and communication.

RESEARCH GAP FRONTIERS

Quantum Optimization Algorithms

Exploration of quantum computing paradigms for solving NP-hard optimization problems with potential exponential speedup over classical methods.

RESEARCH GAP FRONTIERS

Real-time Supply Chain Optimization

Development of fast, adaptive algorithms for dynamic inventory management, routing, and procurement decisions in volatile supply networks.

RESEARCH GAP FRONTIERS

Large-Scale Network Flow Problems

Algorithmic innovations for solving minimum cost flow, maximum flow, and related problems on networks with millions of nodes and edges.

RESEARCH GAP FRONTIERS

Bilevel Optimization Games

Analysis and solution methods for hierarchical decision-making problems where one agent optimizes while accounting for another agent''s optimal response.

Nonlinear Semidefinite Programming

Development of interior-point and first-order methods for large-scale semidefinite programs with nonlinear objectives and constraints.

Approximation Algorithms Theory

Analysis of polynomial-time approximation schemes and hardness results for computationally intractable combinatorial optimization problems.

Healthcare Resource Allocation

Optimization models for surgical scheduling, patient admission, staffing, and resource distribution in complex hospital and clinical systems.

Vehicle Routing with Time Windows

Advanced exact and heuristic methods for vehicle routing problems incorporating time windows, heterogeneous fleets, and multiple constraints.

Online Learning Optimization

Study of algorithms for sequential decision-making with incomplete information and adaptive competitor strategies in competitive environments.

Convex Relaxation Techniques

Investigation of semidefinite and conic relaxations for obtaining tight bounds and approximate solutions to non-convex integer programs.

Facility Location and Clustering

Optimization models for strategic placement of facilities, warehouses, and service centers to minimize total cost while meeting demand.

Variational Inequalities Methods

Development of solution algorithms for variational inequality and monotone operator problems arising in equilibrium and network analysis.

Sparse Optimization and Compressed Sensing

Theory and algorithms for recovering sparse signals from underdetermined systems through convex and nonconvex optimization formulations.

Time-Dependent Traffic Flow Optimization

Algorithms for dynamic traffic assignment, congestion prediction, and toll pricing in time-varying transportation networks.

Portfolio Optimization with Risk Measures

Development of advanced portfolio selection models incorporating conditional value-at-risk, ambiguity sets, and multi-period rebalancing strategies.

Cutting Plane Methods and Separations

Innovation in cutting plane algorithms, separation oracle design, and strengthening techniques for solving large-scale integer programs.

Scheduled Maintenance Optimization

Optimization frameworks for preventive and predictive maintenance scheduling in asset-heavy industries to minimize downtime and costs.

Federated Learning Optimization

Distributed optimization algorithms for training machine learning models across decentralized data sources with privacy and communication constraints.

Constraint Programming and Satisfaction

Development of constraint propagation, inference techniques, and hybrid methods for solving constraint satisfaction and optimization problems.

Energy Grid Optimization and Balancing

Optimization models for power generation, transmission, distribution, and microgrid management with renewable energy integration.

Submodular Optimization Applications

Study of polynomial-time approximation algorithms for maximizing submodular functions in sensor placement, influence, and resource allocation.

Integer Programming Reformulations

Development of extended formulations, symmetry-breaking constraints, and Big-M reformulations to improve integer program tractability.

Smart City Infrastructure Planning

Optimization of urban systems including public transportation, parking, waste collection, and utility networks for sustainability and efficiency.

First-Order Methods for Large Scale

Analysis and design of gradient descent, proximal, and mirror descent methods with convergence guarantees for large-scale optimization.

Production Planning with Uncertainties

Stochastic and robust optimization models for multi-period production, inventory, and capacity decisions under demand and cost uncertainty.

Workforce Scheduling Algorithms

Algorithms for employee shift scheduling, rostering, and assignment balancing preferences, regulations, and service level requirements.

Column Generation and Branch-Price-Cut

Implementation of column generation frameworks and branch-and-price-and-cut algorithms for large-scale structured integer programs.

Game Theory Equilibrium Computation

Algorithms for computing Nash equilibria, correlated equilibria, and solution concepts in strategic multi-player optimization problems.

Disaster Response and Relief Planning

Optimization models for pre-disaster preparedness, emergency resource allocation, and post-disaster recovery in crisis management.

Hyperparameter Optimization Methods

Bayesian optimization, grid search alternatives, and evolutionary algorithms for tuning machine learning and simulation model parameters.

Revenue Management and Pricing

Dynamic pricing and capacity allocation models for industries with perishable inventory, demand uncertainty, and customer heterogeneity.

Augmented Lagrangian Methods

Development and convergence analysis of augmented Lagrangian algorithms for constrained optimization with practical engineering applications.

Supply Chain Resilience Modeling

Optimization frameworks for designing supply networks resilient to disruptions with redundancy, flexibility, and recovery considerations.

Mixed-Integer Nonlinear Programming

Algorithms and decomposition methods for solving mixed-integer nonlinear programs combining discrete and continuous nonconvex variables.

Environmental Impact Optimization

Multi-objective optimization for carbon footprint reduction, emissions control, and sustainable operations in manufacturing and logistics.

Matching and Assignment Problems

Algorithms for maximum weighted matching, stable matching, and assignment problems with practical applications in markets and allocation.

Adaptive Sampling and Sequential Design

Optimization of information acquisition strategies and experimental designs through sequential decision-making under uncertainty.

Manufacturing System Optimization

Optimization of production sequences, job shop scheduling, and manufacturing layouts to minimize makespan and resource utilization.

Proximal and Splitting Methods

Development of proximal algorithms, Douglas-Rachford splitting, and operator splitting for distributed and parallel optimization.

Subscription and Revenue Bundling

Optimization models for product bundling, subscription service design, and customer lifetime value maximization strategies.

Traveling Salesman Variants

Advanced heuristics, metaheuristics, and exact methods for traveling salesman problem variants including asymmetric, prize, and orienteering versions.

Adversarial Optimization Games

Study of min-max optimization, adversarial robustness, and game-theoretic approaches in optimization under strategic or adversarial conditions.

Stochastic Control and Estimation

Optimal control of stochastic systems using dynamic programming, Kalman filtering, and model predictive control under uncertainty.

Graph Partitioning and Clustering

Algorithms for balanced graph partitioning, community detection, and network clustering minimizing edge cuts or optimizing modularity.

Preference Elicitation Optimization

Efficient algorithms for learning decision-maker preferences through strategic queries and adaptive questioning in multi-objective optimization.

Financial Network Systemic Risk

Optimization models for assessing and mitigating systemic risk in financial networks through portfolio rebalancing and stress testing.

Conic Optimization and Interior Point Methods

Development and analysis of interior point algorithms for solving second-order cone programming and semidefinite optimization problems with applications to robust control.

Derivative-Free Optimization for Simulation-Based Problems

Research on black-box optimization techniques including Bayesian optimization and pattern search methods for computationally expensive engineering simulations.

Combinatorial Optimization with Machine Learning

Integration of neural networks and deep learning with combinatorial solvers for improved heuristic performance on NP-hard graph problems.

Stochastic Approximation and Convergence Analysis

Theoretical foundations for recursive algorithms used in online learning and adaptive control with convergence rate characterization.

Decentralized and Consensus Optimization Algorithms

Analysis of distributed algorithms achieving consensus in multi-agent systems without centralized coordination for networked optimization.

Exponential Mechanism and Differential Privacy Optimization

Development of privacy-preserving optimization algorithms that maintain differential privacy guarantees while solving convex and non-convex programs.

Parametric Optimization and Sensitivity Analysis

Study of how optimal solutions and values change with problem parameters including shadow price computation and post-optimality analysis.

Chance-Constrained Optimization Under Uncertainty

Methods for reformulating and solving probabilistic constraint problems where decisions must satisfy random inequality constraints with high probability.

Federated Resource Allocation Networks

Distributed algorithms for optimal resource allocation across federated systems maintaining data privacy and local autonomy.

Multi-Objective Evolutionary Optimization Algorithms

Pareto-optimal solution discovery using genetic algorithms and evolution strategies for competing objectives in complex engineering design.

Dynamic Pricing with Demand Learning

Real-time pricing optimization strategies that balance exploration of demand curves with exploitation of learned willingness-to-pay information.

Dualization and Lagrangian Relaxation Techniques

Theoretical and computational aspects of Lagrangian duality for obtaining bounds and decomposition in structured optimization problems.

Nonsmooth and Nonconvex Optimization Methods

Algorithms for solving problems with non-differentiable objectives and non-convex constraints including subdifferential-based methods.

Inventory Control with Correlated Demands

Optimal ordering policies for multi-period inventory systems with temporally and spatially dependent demand patterns and lead times.

Network Design with Reliability Constraints

Strategic infrastructure investment optimization ensuring network resilience against failures and disruptions with redundancy and recovery considerations.

Online Convex Optimization Regret Bounds

Analysis of no-regret algorithms in adversarial online settings with applications to sequential decision-making and adaptive control.

Auction Design and Mechanism Theory Optimization

Application of optimization theory to designing truthful auctions and incentive-compatible mechanisms for resource allocation.

Markov Decision Processes with Large State Spaces

Scalable methods for solving dynamic programming problems in environments with exponential state space growth using function approximation.

Inverse Optimization and Preference Learning

Techniques for inferring objective functions and preferences from observed optimal decisions with applications to behavioral economics.

Temporal Decomposition for Multi-Stage Stochastic Programs

Benders decomposition and scenario-based methods for solving large-scale multi-horizon stochastic optimization with rolling planning.

Collaborative Filtering and Recommendation Systems Optimization

Large-scale matrix factorization and tensor optimization methods for personalized product recommendations and demand prediction.

Warm-starting and Solution Transfer Optimization

Methods for leveraging previous solutions to accelerate optimization of similar or related problems with structural similarities.

Risk-Averse Stochastic Programming with CVaR

Development of conditional value-at-risk and spectral risk measure-based formulations for risk management in decision-making.

Reinforcement Learning with Optimization Constraints

Integration of constraint satisfaction and optimization objectives into reinforcement learning policies for feasible action selection.

Cross-Dock and Transshipment Network Design

Optimization of hub-and-spoke logistics networks minimizing handling costs and transit times through intermediate consolidation points.

Sparse and Low-Rank Matrix Recovery Methods

Convex relaxations and optimization algorithms for recovering sparse or low-rank matrices from incomplete or noisy observations.

Personnel Scheduling with Fairness Criteria

Optimization models balancing operational efficiency with equitable work distribution and employee preference satisfaction in shift scheduling.

Gradient Descent Variants and Acceleration Methods

Analysis of momentum-based, variance-reduced, and accelerated gradient methods with improved convergence rates for convex optimization.

Robust Control Synthesis via Convex Optimization

Linear matrix inequalities and semidefinite programming formulations for designing control systems resilient to uncertainty and disturbances.

Location-Routing Integration for Last-Mile Delivery

Joint optimization of depot locations and vehicle routes for minimizing distribution costs in e-commerce and parcel delivery networks.

Kernel Methods and Support Vector Optimization

Optimization formulations for support vector machines and kernel-based learning with applications to classification and regression.

Sparse Portfolio Selection with Transaction Costs

Cardinality-constrained portfolio optimization minimizing trading costs and market impact while controlling diversification levels.

Coordination in Supply Networks using Contracts

Game-theoretic optimization of contract terms achieving supply chain coordination between independent players with misaligned objectives.

Variational Methods and Optimal Transport

Optimization using Wasserstein distances and transport maps for applications in distribution matching and geometric data analysis.

Integer Linear Programming Formulations and Strength

Research on alternative MIP formulations, lower bounds from linear relaxations, and polyhedral structure analysis of optimization problems.

Networked Control Systems and Distributed Estimation

Optimization of sensor placement and communication topology for estimation and control in networked dynamic systems.

Algorithm Portfolios and Hybrid Metaheuristics

Strategies for combining multiple heuristic and exact algorithms with adaptive selection based on problem features and runtime performance.

Green Logistics and Carbon Footprint Minimization

Multi-objective optimization of transportation networks and operations balancing cost efficiency with environmental impact reduction.

Tensor Decomposition and Optimization Methods

Algorithms for decomposing higher-order tensors into low-rank components with applications to data analysis and feature extraction.

Real-time Dispatching and Dynamic Routing Algorithms

Fast heuristics for computing near-optimal vehicle routes under time-varying traffic conditions and dynamic customer arrival patterns.

Spectral Methods and Eigenvalue Optimization

Optimization algorithms based on spectral properties of matrices with applications to clustering, graph partitioning, and control design.

Inventory Transshipment and Lateral Transshipment

Optimization policies for emergency stock transfers between facilities and lateral shipments reducing overall system holding costs.

Accelerated Methods with Composite Objectives

Optimization algorithms for sum of smooth and non-smooth functions achieving near-optimal convergence rates in composite problems.

Humanitarian Logistics and Disaster Relief Optimization

Real-time allocation and routing of emergency supplies and personnel in humanitarian response operations under resource constraints.

Project Scheduling with Resource Constraints and Leveling

Optimization methods for critical path analysis minimizing project duration while maintaining feasible resource allocation across activities.

Zeroth-Order Optimization and Black-Box Methods

Algorithms requiring only function value evaluations for optimization including gradient-free methods and derivative-free approaches.

Cross-Selling and Bundle Optimization in E-commerce

Recommender system optimization for product bundling and cross-selling maximizing customer lifetime value and average order value.

Bilevel Optimization in Hyperparameter Tuning

Optimization of machine learning model hyperparameters through nested bilevel problems using gradient-based and implicit differentiation methods.

Subgradient and Proximal Gradient Algorithms

First-order methods for non-smooth and composite optimization with convergence guarantees and practical acceleration techniques.

Healthcare Appointment Scheduling and Capacity Planning

Optimization of clinic and hospital scheduling balancing patient waiting times with staff utilization and resource efficiency.

Derivative-Free and Black-Box Optimization

Algorithms for optimizing functions where gradients are unavailable or expensive, including Bayesian optimization and surrogate-based methods.

Combinatorial Optimization via Metaheuristics

Advanced heuristic and metaheuristic approaches such as genetic algorithms, simulated annealing, and particle swarm optimization for NP-hard problems.

Two-Stage Stochastic Programming Applications

Theory and computation of two-stage stochastic programs with applications to capacity expansion, inventory management, and infrastructure planning.

Gradient Descent and Acceleration Methods

Analysis of convergence rates and optimization techniques for accelerated gradient methods including Nesterov acceleration and heavy-ball methods.

Multi-Objective Optimization and Pareto Frontiers

Methods for computing efficient frontiers and solving multi-criteria decision problems with competing objectives in complex systems.

Decomposition Methods for Large Problems

Dantzig-Wolfe and Benders decomposition techniques for solving block-structured optimization problems with application to distributed systems.

Convex Geometry and Polytope Theory

Theoretical analysis of polyhedral structures, face lattices, and geometric properties essential to linear and convex programming.

Bandit Problems and Exploration-Exploitation

Sequential decision-making under uncertainty including multi-armed bandits, contextual bandits, and dynamic regret minimization.

Network Design and Expansion Planning

Optimization of strategic investment in network infrastructure considering capacity, resilience, and long-term operational efficiency.

Inverse Optimization and Parameter Estimation

Recovery of objective functions and constraints from observed decisions, with applications to preference learning and behavioral analysis.

Markov Decision Processes and Control

Solution techniques for infinite-horizon Markov decision processes including value iteration and policy gradient methods.

Chance-Constrained Optimization Models

Formulation and solution of optimization problems with probabilistic constraints ensuring feasibility with specified confidence levels.

Linear Programming Duality and Sensitivity

Analysis of dual problems, shadow prices, and parametric sensitivity in linear programs with applications to economic interpretation.

Time-Series Forecasting for Operations

Predictive modeling and forecasting techniques for demand, failures, and system behavior to support optimization decisions.

Network Equilibrium and Traffic Assignment

Computation of user equilibrium and system optimum in transportation networks with applications to congestion pricing.

Inventory Management Under Demand Uncertainty

Optimal policies for inventory systems with stochastic demand including safety stock, newsvendor, and multi-echelon models.

Online Algorithms and Competitive Analysis

Analysis of algorithms that make decisions without future information, with competitive ratio bounds against optimal offline solutions.

Reinforcement Learning in Operations

Application of Q-learning, policy gradients, and actor-critic methods to dynamic operational control and resource allocation problems.

Robust Control and Worst-Case Analysis

Optimization under worst-case uncertainty sets with applications to control design and operations under adversarial conditions.

Queueing Theory and Performance Analysis

Analysis and optimization of queueing networks to determine service capacity, staffing levels, and system performance metrics.

Manpower Planning and Career Path Optimization

Strategic workforce planning including recruitment, training, development, and attrition with long-term organizational objectives.

Optimal Transport and Wasserstein Distances

Theory and algorithms for optimal transport problems with applications to logistics, machine learning, and probability distributions.

Adaptive Robust Optimization Strategies

Dynamic decision-making under uncertainty using adjustable robust optimization and adaptive strategies for multi-stage problems.

Nonconvex Optimization Theory and Algorithms

Analysis of local convergence, saddle point escape, and global optimization techniques for nonconvex objectives.

Data-Driven Optimization and Machine Learning

Integration of machine learning predictions into optimization models for improved decision-making with data uncertainty.

Simulation-Based Optimization Methods

Optimization using stochastic simulation for complex systems where closed-form models are unavailable or intractable.

Auction-Based Resource Allocation

Decentralized allocation mechanisms using auction theory for cloud computing, spectrum, and market-based distributed systems.

Hospital Bed Management and Scheduling

Optimization of bed allocation, patient admission, surgery scheduling, and discharge planning in healthcare facilities.

Supply Chain Network Optimization

Design and operation of multi-tier supply networks considering sourcing, production, distribution, and customer satisfaction.

Preference Learning from Choice Data

Inference of utility functions and preferences from observed choices using discrete choice models and revealed preference theory.

Variance Reduction in Stochastic Optimization

Techniques including importance sampling, control variates, and antithetic sampling for improving stochastic gradient methods.

Scheduling with Machine Learning Predictions

Job scheduling and resource allocation using predicted processing times and job characteristics from machine learning models.

Integer Solutions in Relaxed Programs

Analysis of when continuous relaxations yield integer solutions and development of techniques to find integer feasible points.

Location-Allocation and Coverage Models

Optimization of service facility locations to maximize coverage, minimize cost, or balance accessibility in urban planning.

Equity and Fairness in Resource Allocation

Incorporation of fairness metrics and equity constraints in optimization to ensure socially just allocation outcomes.

Cyclic Scheduling and Periodic Operations

Optimization of repetitive and periodic operational schedules in manufacturing, transportation, and service systems.

Power Systems Operation and Stability

Optimization of power generation, transmission, and distribution including unit commitment, economic dispatch, and stability constraints.

Algorithmic Game Theory Applications

Application of game-theoretic algorithms to strategic resource allocation, pricing, and mechanism design in competitive systems.

Air Traffic Flow Management Optimization

Optimization of flight paths, departure schedules, and arrival sequences to minimize delays and fuel consumption.

Portfolio Optimization and Asset Allocation

Selection of investment portfolios balancing expected returns, risk measures, and diversification constraints.

Tensor Decomposition and Multilinear Optimization

Optimization over multilinear structures including tensor factorization and decomposition for high-dimensional data.

Patient Flow and Hospital Operations

Optimization of patient routing, treatment sequences, and resource utilization in emergency departments and hospitals.

Drone and Autonomous Vehicle Routing

Route planning and coordination for unmanned vehicles considering battery constraints, airspace restrictions, and service requirements.

Auction Participation and Bidding Strategy

Optimal bidding strategies in multi-round auctions, combinatorial auctions, and dynamic bidding environments.

Pricing and Revenue Optimization

Dynamic pricing, yield management, and revenue maximization considering demand elasticity and competition.

Network Reliability and Survivability

Design and operation of resilient networks with optimization under link and node failures.

Bulk Service and Batch Processing Optimization

Optimization of batch sizes, service rates, and scheduling in systems with bulk arrivals or batch processing capabilities.

Consensus and Decentralized Optimization

Distributed algorithms for reaching consensus and solving optimization problems in decentralized networks without central coordination.

Conic Programming and Interior Point Methods

Development and analysis of interior point algorithms for second-order cone programming and their computational complexity in large-scale convex optimization problems.

Multi-Objective Evolutionary Algorithms Design

Design and convergence analysis of evolutionary algorithms for Pareto-optimal solutions in multi-criteria decision-making optimization problems.

Decomposition Methods for Large Systems

Benders decomposition, Dantzig-Wolfe methods, and their variants for solving high-dimensional structured optimization problems efficiently.

Stochastic Approximation and Gradient Descent

Convergence theory and acceleration techniques for stochastic gradient methods in non-convex and variance-reduced settings.

Network Design and Optimization

Strategic design of resilient telecommunications and transportation networks under capacity and connectivity constraints.

Markov Decision Process Applications

Theory and algorithms for solving Markov decision processes with large state spaces and continuous control variables.

Simulated Annealing and Metaheuristics

Design and theoretical analysis of metaheuristic algorithms including simulated annealing, tabu search, and ant colony optimization.

Water Resource Management Optimization

Allocation and control of water resources across competing sectors considering environmental and sustainability constraints.

Scheduling Theory and Job Shop Problems

Analysis of computational complexity and approximation algorithms for job shop scheduling and machine scheduling variants.

Cooperative Game Theory Applications

Study of coalitional games, Shapley values, and fair allocation mechanisms in cooperative optimization frameworks.

Convex Geometry and Polytope Analysis

Investigation of facial structures, extreme points, and combinatorial properties of polytopes arising in optimization.

Online Optimization and Competitive Analysis

Design and analysis of algorithms for online problems with unknown future information and competitive ratio bounds.

Nonsmooth Optimization Techniques

Development of subdifferential calculus and algorithms for non-differentiable convex and non-convex optimization problems.

Airline Fleet Assignment Problem

Optimization of aircraft deployment and schedule assignment for revenue maximization in airline operations.

Tensor Decomposition and Factorization

Algorithms for decomposing multi-dimensional tensors with applications to data mining and dimensionality reduction.

Queueing Theory and Network Analysis

Analysis of queueing systems and performance optimization in network processes and congestion control.

Combinatorial Auction Winner Determination

Algorithms for solving the winner determination problem in combinatorial auctions with complex bid constraints.

Parallel and GPU-Accelerated Algorithms

Design of optimization algorithms exploiting parallel computing architectures for solving large-scale problems efficiently.

Bilinear Matrix Inequalities Optimization

Solution methods for problems involving bilinear matrix inequalities in robust control and system design.

Drone Delivery Route Optimization

Algorithms for optimizing multi-drone delivery networks with flight time constraints and charging station placement.

Equilibrium Programming and Variational Methods

Solution techniques for equilibrium problems and variational formulations in operations research applications.

Knapsack Problem Variants and Solutions

Exact and approximate algorithms for multi-dimensional, bounded, and unbounded knapsack problem variations.

Sparse Linear Systems and Factorization

Efficient factorization methods and sparse matrix techniques for solving large linear systems in optimization.

Patient Admission and Bed Management

Optimization of hospital bed allocation, patient admission scheduling, and operating room utilization.

Semidefinite Relaxations and Bounds

Derivation and tightening of semidefinite programming relaxations to obtain bounds for combinatorial problems.

Wireless Network Spectrum Allocation

Strategic allocation of wireless spectrum and interference management for maximizing network capacity.

Credit Risk Portfolio Management

Optimization techniques for managing credit risk portfolios and default probability estimation.

Asymmetric Traveling Salesman Problem

Specialized algorithms and bounds for asymmetric variants of the traveling salesman problem.

Optimization under Complementarity Constraints

Solution methods for mathematical programs with complementarity constraints arising in equilibrium models.

Autonomous Vehicle Path Planning

Real-time path planning and collision avoidance algorithms for autonomous vehicle navigation systems.

Second-Order Optimization Methods

Newton, quasi-Newton, and trust-region methods for unconstrained and constrained optimization problems.

Forest Resource Harvesting Optimization

Long-term planning of timber harvesting and forest management to maximize economic and environmental objectives.

Chance-Constrained Programming Methods

Algorithms for solving stochastic optimization problems with probabilistic feasibility constraints.

Sensor Network Deployment Optimization

Optimal placement and configuration of sensors in networks for coverage and monitoring objectives.

Convex-Concave Saddle Point Problems

Algorithms for finding saddle points in convex-concave minimax optimization and game-theoretic settings.

Pharmaceutical Supply Chain Coordination

Optimization of drug distribution networks and inventory coordination across pharmaceutical supply chains.

Mixed-Integer Conic Programming

Branch-and-cut and cutting plane algorithms for mixed-integer problems involving conic constraints.

Demand Response and Smart Grids

Optimization of consumer demand response programs and real-time pricing in smart electrical grids.

Coordinate Descent and Randomized Methods

Convergence analysis and acceleration of coordinate descent and randomized optimization algorithms.

Traffic Signal Timing Optimization

Design of adaptive traffic signal control systems to minimize congestion and improve traffic flow.

Preference Learning in Combinatorial Choice Optimization

This research focuses on inferring agent preferences from observed choices and leveraging this learning to solve large-scale combinatorial optimization problems with implicit objective functions.

Decentralized Consensus Algorithms for Networked Systems

This research develops distributed consensus protocols that enable autonomous agents in networked systems to reach optimal collective decisions without centralized coordination or complete information sharing.

Information Theory in Optimization

Application of information-theoretic concepts to lower bounds and algorithm design in optimization.

Temporal Decomposition Methods for Dynamic Optimization

This research explores advanced time-staged decomposition techniques and rolling-horizon approaches to solve multi-period optimization problems with temporal dependencies and evolving constraints.

Hotel Revenue Management Systems

Dynamic pricing and room allocation optimization for hotels to maximize occupancy and revenue.

Data-Driven Stochastic Optimization with Limited Observations

This research develops optimization algorithms that learn robust decision policies from incomplete or sparse data while maintaining statistical and computational guarantees.

Monotone Operator Splitting Methods

Theory and algorithms for splitting monotone operators in distributed and decentralized optimization.

Retail Store Location Network

Strategic optimization of retail store locations considering demand, competition, and logistics costs.

Hypergraph Partitioning and Multi-Way Clustering

This research advances algorithms for decomposing hypergraph structures into balanced partitions with minimal edge cuts, with applications to complex system design and resource allocation.

Inverse Optimization and Parameter Recovery

This research develops techniques to recover cost coefficients, constraints, and objective function parameters by observing optimal or near-optimal decisions from real-world systems.

Randomized Rounding and Derandomization

Probabilistic techniques for converting relaxation solutions to feasible integer solutions with approximation guarantees.

Fair Resource Allocation and Multi-Agent Equity

This research designs allocation mechanisms that optimize efficiency while ensuring fairness criteria across multiple competing agents and stakeholder groups.