Current PB solvers implement many techniques inspired by the CDCL architecture of modern SAT solvers, so as to benefit from its practical efficiency. However, they also need to deal with the fact that many of the properties leveraged by this architecture are no longer true when considering PB constraints. In this paper, we focus on one of these properties, namely the optimality of the so-called first unique implication point (1-UIP). While it is well known that learning the first assertive clause produced during conflict analysis ensures to perform the highest possible backjump in a SAT solver, we show that there is no such guarantee in the presence of PB constraints. We also introduce and evaluate different approaches designed to improve the backjump level identified during conflict analysis by allowing to continue the analysis after reaching the 1-UIP. Our experiments show that sub-optimal backjumps are fairly common in PB solvers, even though their impact on the solver is not clear.
Hyperparameter Optimization of Constraint Programming Solvers
Interdisciplinary Centre for Security, Reliability and Trust (SnT)(安全、可靠性与信任跨学科中心);University of Luxembourg(卢森堡大学);Faculty of Science, Technology and Medicine (FSTM)(科学、技术与医学学院)
Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture
Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院、教育部符号计算与知识工程重点实验室);Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly, Nanyang Technological University(南洋理工大学、新加坡国立大学-不列颠哥伦比亚大学老年人积极生活联合卓越研究中心);WeBank-NTU Joint Research Institute on Fintech, Nanyang Technological University(南洋理工大学微众银行金融科技联合研究院);College of Computing and Data Science, Nanyang Technological University(南洋理工大学计算与数据科学学院)
SymMaP: Improving Computational Efficiency in Linear Solvers through Symbolic Preconditioning
University of Science and Technology of China(中国科学技术大学);CAS Key Laboratory of Technology in GIPAS, University of Science and Technology of China(中国科学技术大学国家实验室(GIPAS技术))
AlphaOPT: Formulating Optimization Programs with Self-Improving LLM Experience Library
Singapore-MIT Alliance for Research and Technology(新加坡-麻省理工联合研究技术联盟);Massachusetts Institute of Technology(麻省理工学院);University of Florida(佛罗里达大学);Northeastern University(东北大学);Singapore Management University(新加坡管理学院)
Beyond Accuracy: EcoL2 Metric for Sustainable Neural PDE Solvers
Department of Engineering Structures(工程结构系);TU Delft(代尔夫特理工大学);Department of Electrical Engineering(电气工程系);TU Eindhoven(埃因霍温理工大学);Laboratory of Earthquake Engineering(地震工程实验室);National Technical University of Athens(雅典国家技术大学);Machine Learning Research Group(机器学习研究组);University of Oxford(牛津大学)
ML4CO: Is GCNN All You Need? Graph Convolutional Neural Networks Produce Strong Baselines For Combinatorial Optimization Problems, If Tuned and Trained Properly, on Appropriate Data