Reinforcement learning of simplex pivot rules: a proof of concept
From MaRDI portal
Publication:2080843
DOI10.1007/s11590-022-01880-yzbMath1503.90069OpenAlexW4224238559MaRDI QIDQ2080843
Varun Suriyanarayana, Onur Tavaslıoğlu, Ankit B. Patel, Andrew J. Schaefer
Publication date: 11 October 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01880-y
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Fleet scheduling in underground mines using constraint programming
- Steepest-edge simplex algorithms for linear programming
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Pivoting rules for the revised simplex algorithm
- Integer Programming Formulation of Traveling Salesman Problems
- Online Mixed-Integer Optimization in Milliseconds