52 citations · 126 across the 16 of their papers we have counts for
4 papers · 1 filter
SATformer: Transformer-Based UNSAT Core Learning
Zhengyuan Shi, Min Li, Yi Liu +5
This paper introduces SATformer, a novel Transformer-based approach for the Boolean Satisfiability (SAT) problem. Rather than solving the problem directly, SATformer approaches the…
Branch Ranking for Efficient Mixed-Integer Programming via Offline Ranking-based Policy Learning
Zeren Huang, Wenhao Chen, Weinan Zhang +7
Deriving a good variable selection strategy in branch-and-bound is essential for the efficiency of modern mixed-integer programming (MIP) solvers. With MIP branching data collected…
A Survey for Solving Mixed Integer Programming via Machine Learning
Jiayi Zhang, Chang Liu, Junchi Yan +3
This paper surveys the trend of leveraging machine learning to solve mixed integer programming (MIP) problems. Theoretically, MIP is an NP-hard problem, and most of the combinatori…
Machine Learning Methods in Solving the Boolean Satisfiability Problem
Wenxuan Guo, Junchi Yan, Hui-Ling Zhen +3
This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT), an archetypal NP-complete problem, with the help of machine learning techniques. Despi…