148 citations · 666 across the 29 of their papers we have counts for
4 papers · 1 filter
Recovering Dantzig-Wolfe Bounds by Cutting Planes
Rui Chen, Oktay Gunluk, Andrea Lodi
Dantzig-Wolfe (DW) decomposition is a well-known technique in mixed-integer programming (MIP) for decomposing and convexifying constraints to obtain potentially strong dual bounds.…
Online Decision Making with Fairness over Time
Rui Chen, Oktay Gunluk, Andrea Lodi +1
Online platforms increasingly rely on sequential decision-making algorithms to allocate resources, match users, or control exposure, while facing growing pressure to ensure fairnes…
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
Rui Chen, James Luedtke
We propose a new method for separating valid inequalities for the epigraph of a function of binary variables. The proposed inequalities are disjunctive cuts defined by disjunctive…
Convexifying Multilinear Sets with Cardinality Constraints: Structural Properties, Nested Case and Extensions
Rui Chen, Sanjeeb Dash, Oktay Gunluk
The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called…