Artificial Intelligence for Operations Research: Revolutionizing the Operations Research Process

Z Fan, B Ghaddar, X Wang, L Xing, Y Zhang… - arXiv preprint arXiv …, 2024 - arxiv.org
The rapid advancement of artificial intelligence (AI) techniques has opened up new
opportunities to revolutionize various fields, including operations research (OR). This survey …

Learning to Pivot as a Smart Expert

T Liu, S Pu, D Ge, Y Ye - Proceedings of the AAAI Conference on …, 2024 - ojs.aaai.org
Linear programming has been practically solved mainly by simplex and interior point
methods. Compared with the weakly polynomial complexity obtained by the interior point …

General Method for Solving Four Types of SAT Problems

A Li, C Han, T Guo, H Li, B Li - arXiv preprint arXiv:2312.16423, 2023 - arxiv.org
Existing methods provide varying algorithms for different types of Boolean satisfiability
problems (SAT), lacking a general solution framework. Accordingly, this study proposes a …

Generating linear programming instances with controllable rank and condition number

A Li, C Han, T Guo, B Li - Computers & Operations Research, 2024 - Elsevier
Instance generation is crucial for linear programming algorithms, especially for the
evaluation and verification of corresponding methods. This study proposes a general …

RL Simplex: Bringing Computational Efficiency in Linear Programming via Reinforcement Learning

G Zhao, A Dehghanian, M Noorizadegan, N Serban - openreview.net
In the simplex method, the selection of variables during the pivot operation in each iteration
significantly impacts the overall computational process. The primary objective of this study is …