26 citations · 119 across the 19 of their papers we have counts for
5 papers · 2 filters
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…
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…
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…
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…