4 papers · 1 filter
Parallelizable Gradient-Based Optimization For Multi-Objective MaxCut
Jingjuan Huang, Alvaro Velasquez, Cheng-Han Huang +3
Multi-objective combinatorial optimization arises in a wide range of problems and applications, including the canonical multi-objective MaxCut problem. Differentiable single-instan…
Differentiable Repairability & Mutations for Scalable Combinatorial Optimization
Yongliang Sun, Ismail Alkhouri, Cheng-Han Huang +3
Combinatorial optimization problems such as Maximum Independent Set (MIS) and Maximum Cut (MaxCut) arise across a wide range of applications, yet solving large-scale instances rema…
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…
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…