2 citations · 3 across the 12 of their papers we have counts for
4 papers · 1 filter
LLMs for Cold-Start Cutting Plane Separator Configuration
Connor Lawless, Yingxi Li, Anders Wikum +2
Mixed integer linear programming (MILP) solvers expose hundreds of parameters that have an outsized impact on performance but are difficult to configure for all but expert users. E…
Wait-Less Offline Tuning and Re-solving for Online Decision Making
Jingruo Sun, Wenzhi Gao, Ellen Vitercik +1
Online linear programming (OLP) has found broad applications in revenue management and resource allocation. State-of-the-art OLP algorithms achieve low regret by repeatedly solving…
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
Alexandre Hayderi, Amin Saberi, Ellen Vitercik +1
Online Bayesian bipartite matching is a central problem in digital marketplaces and exchanges, including advertising, crowdsourcing, ridesharing, and kidney exchange. We introduce…
Accelerating data-driven algorithm selection for combinatorial partitioning problems
Vaggos Chatziafratis, Ishani Karmarkar, Yingxi Li +1
Data-driven algorithm selection is a powerful approach for choosing effective heuristics for computational problems. It operates by evaluating a set of candidate algorithms on a co…