3 papers
cs.LG2026
Differentiable Initialization-Accelerated CPU-GPU Hybrid Combinatorial Scheduling
Mingju Liu, Jiaqi Yin, Alvaro Velasquez +1
This paper presents a hybrid CPU-GPU framework for solving combinatorial scheduling problems formulated as Integer Linear Programming (ILP). While scheduling underpins many optimiz…
cs.LO2026
GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
Curie Kim, Carsten Portner, Mingju Liu +6
Boolean satisfiability (SAT) problem, the first problem proven to be NP-complete, has become a fundamental challenge in computational complexity, with widespread applications in op…
cs.LG2025
A Dataless Reinforcement Learning Approach to Rounding Hyperplane Optimization for Max-Cut
Gabriel Maliakal, Ismail Alkhouri, Alvaro Velasquez +2
The Maximum Cut (MaxCut) problem is NP-Complete, and obtaining its optimal solution is NP-hard in the worst case. As a result, heuristic-based algorithms are commonly used, though…