activity
20232026
collaborators

8 papers

math.OC2026

Tightening CVaR Approximations via Scenario-Wise Scaling for Chance-Constrained Programming

Rui Chen, Nan Jiang

Chance-constrained programs (CCPs) provide a powerful modeling framework for decision-making under uncertainty, but their nonconvex feasible regions make them computationally chall…

cs.LG2025

Hyperdimensional Computing for Sustainable Manufacturing: An Initial Assessment

Danny Hoang, Anandkumar Patel, Ruimen Chen +2

Smart manufacturing can significantly improve efficiency and reduce energy consumption, yet the energy demands of AI models may offset these gains. This study utilizes in-situ sens…

math.OC2025

On the Convexification of a Class of Mixed-Integer Conic Sets

Guxin Du, Rui Chen, Linchuan Wei

We investigate mixed-integer second-order conic (SOC) sets with a nonlinear right-hand side in the SOC constraint, a structure frequently arising in mixed-integer quadratically con…

stat.ML2025

Inexact Column Generation for Bayesian Network Structure Learning via Difference-of-Submodular Optimization

Yiran Yang, Rui Chen

In this paper, we consider a score-based Integer Programming (IP) approach for solving the Bayesian Network Structure Learning (BNSL) problem. State-of-the-art BNSL IP formulations…

math.OC2025

Learning Large Neighborhood Search for Maritime Inventory Routing Optimization

Rui Chen, Defeng Liu, Nan Jiang +3

Maritime inventory routing optimization is an important yet challenging combinatorial optimization problem. We propose a machine learning-based local search approach for finding fe…

cs.LG2024

Proper Dataset Valuation by Pointwise Mutual Information

Rui Ray Chen, Xuan Qi, Yuxin Chen +3

Data plays a central role in advancements in modern artificial intelligence, with high-quality data emerging as a key driver of model performance. This has prompted the development…

cs.LG2024

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles

Rosario Messana, Rui Chen, Andrea Lodi +1

We consider solving a combinatorial optimization problem with unknown knapsack constraints using a membership oracle for each unknown constraint such that, given a solution, the or…

math.OC2023

Efficient Branching Rules for Optimizing Range and Order-Based Objective Functions

Bart van Rossum, Rui Chen, Andrea Lodi

We consider range minimization problems featuring exponentially many variables, as frequently arising in fairness-oriented or bi-objective optimization. While branch and price is s…