4 citations · 11 across the 26 of their papers we have counts for
5 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…
Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs
Cheng-Han Huang, Yongliang Sun, Chaoyan Huang +2
Many combinatorial optimization problems admit quadratic unconstrained binary formulations (QUBO) which can often be relaxed to the box and optimized using scalable gradi…
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…
A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
Ismail Alkhouri, Mian Wu, Cunxi Yu +3
We propose a scalable framework for solving the Maximum Cut (MaxCut) problem in large graphs using projected gradient ascent on quadratic objectives. Our approach is differentiable…
Differentiable Quadratic Optimization For The Maximum Independent Set Problem
Ismail Alkhouri, Cedric Le Denmat, Yingjie Li +4
Combinatorial Optimization (CO) addresses many important problems, including the challenging Maximum Independent Set (MIS) problem. Alongside exact and heuristic solvers, different…