[1] Y. Azar, D. Panigrahi, and N. Touitou. Online graph algorithms with predictions. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pages 35-66. SIAM, 2022 (cited on page 2).
[2] E. Bamas, A. Maggiori, and O. Svensson. The primal-dual method for learning augmented algorithms. In Advances in Neural Information Processing Systems (NeurIPS 2020), volume 33, pages 20083-20094. Curran Associates, Inc., 2020 (cited on page 2).
[3] C. Bauckhage. NumPy/SciPy recipes for data science: projections onto the standard simplex. Technical report, 2020 (cited on page 9).
[4] P. Brucker. An  $O(n)$  algorithm for quadratic knapsack problems. Operations Research Letters, 3(3):163-166, 1984 (cited on page 3).
[5] N. Cesa-Bianchi, A. Conconi, and C. Gentile. On the generalization ability of on-line learning algorithms. IEEE Transactions on Information Theory, 50(9):2050-2057, 2004 (cited on page 5).
[6] D. Chakrabarty, P. Jain, and P. Kothari. Provable submodular minimization using Wolfe's algorithm. In Advances in Neural Information Processing Systems (NuerIPS 2014), volume 27, pages 802-809. Curran Associates, Inc., 2014 (cited on page 15).
[7] J. Chen, S. Silwal, A. Vakilian, and F. Zhang. Faster fundamental graph algorithms via learned predictions. In Proceedings of the 39th International Conference on Machine Learning (ICML 2022), volume 162, pages 3583-3602. PMLR, 2022 (cited on pages 1-4).
[8] X. Chen and M. Li.  $\mathbf{M}^{\natural}$ -convexity and its applications in operations. Operations Research, 69(5):1396-1408, 2021 (cited on pages 2, 6).
[9] A. Cutkosky. Anytime online-to-batch, optimism and acceleration. In Proceedings of the 36th International Conference on Machine Learning (ICML 2019), volume 97, pages 1446-1454. PMLR, 2019 (cited on page 5).
[10] S. Davies, B. Moseley, S. Vassilitskii, and Y. Wang. Predictive flows for faster Ford-Fulkerson. In Proceedings of the 40th International Conference on Machine Learning (ICML 2023), volume 202, pages 7231-7248. PMLR, 2023 (cited on pages 1, 3, 4).
[11] M. Dinitz, S. Im, T. Lavastida, B. Moseley, and S. Vassilvitskii. Faster matchings via learned duals. In Advances in Neural Information Processing Systems (NeurIPS 2021), volume 34, pages 10393–10406. Curran Associates, Inc., 2021 (cited on pages 1–5).
[12] J. Edmonds. Submodular functions, matroids, and certain polyhedra. In Combinatorial Structures and Their Applications, pages 69-87. Gordon and Breach, New York, 1970 (cited on page 14).
[13] U. Feige. A threshold of  $\ln n$  for approximating set cover. Journal of the ACM, 45(4):634-652, 1998 (cited on page 4).
[14] G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in  $\mathrm{X} + \mathrm{Y}$  and matrices with sorted columns. Journal of Computer and System Sciences, 24(2):197-208, 1982 (cited on page 2).
[15] S. Fujishige. Submodular Functions and Optimization, volume 58 of Annals of Discrete Mathematics. Elsevier, Amsterdam, second edition, 2005 (cited on pages 5, 14).
[16] S. Fujishige, M. Goemans, T. Harks, B. Peis, and R. Zenklusen. Congestion games viewed from M-convexity. Operations Research Letters, 43(3):329–333, 2015 (cited on pages 2, 6).
[17] Gurobi Optimization, LLC. Gurobi optimizer reference manual. https://www.gurobi.com, 2023 (cited on page 9).
[18] D. S. Hochbaum and J. G. Shanthikumar. Convex separable optimization is not much harder than linear optimization. Journal of the ACM, 37(4):843-862, 1990 (cited on page 2).