activity
20212024
most citedMachine Learning Methods in Solving the Boolean Satisfiability Problem

26 citations · 119 across the 19 of their papers we have counts for

collaborators
Showing 2022Show all

7 papers · 1 filter

cs.AI2022★ 7 cited

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…

cs.LG2022★ 1 cited

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…

cs.AR2022

LQoCo: Learning to Optimize Cache Capacity Overloading in Storage Systems

Ji Zhang, Xijun Li, Xiyao Zhou +4

Cache plays an important role to maintain high and stable performance (i.e. high throughput, low tail latency and throughput jitter) in storage systems. Existing rule-based cache m…

cs.AI2022★ 13 cited

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…

cs.AI2022★ 26 cited

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…

cs.AI2022★ 2 cited

A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry

Jiahui Duan, Xialiang Tong, Fei Ni +3

The bin packing problem exists widely in real logistic scenarios (e.g., packing pipeline, express delivery), with its goal to improve the packing efficiency and reduce the transpor…

cs.AI2022★ 5 cited

Introduction to The Dynamic Pickup and Delivery Problem Benchmark -- ICAPS 2021 Competition

Jianye Hao, Jiawen Lu, Xijun Li +4

The Dynamic Pickup and Delivery Problem (DPDP) is an essential problem within the logistics domain. So far, research on this problem has mainly focused on using artificial data whi…