[19] D. S. Hochbaum. Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Mathematics of Operations Research, 19(2):390-409, 1994 (cited on pages 2, 3).
[20] D. S. Hochbaum and S.-P. Hong. About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Mathematical Programming, 69(1-3):269-309, 1995 (cited on pages 3, 15).
[21] T. Ibaraki and N. Katoh. Resource Allocation Problems: Algorithmic Approaches. MIT Press, first edition, 1988 (cited on page 3).
[22] N. Katoh, A. Shioura, and T. Ibaraki. Resource allocation problems. In Handbook of Combinatorial Optimization, pages 2897-2988. Springer, New York, NY, 2013 (cited on pages 2, 3).
[23] M. Khodak, M.-F. Balcan, A. Talwalkar, and S. Vassilvitskii. Learning predictions for algorithms with predictions. In Advances in Neural Information Processing Systems (NeurIPS 2022), volume 35, pages 3542-3555. Curran Associates, Inc., 2022 (cited on pages 2, 5).
[24] S. Lacoste-Julien and M. Jaggi. On the global linear convergence of Frank-Wolfe optimization variants. In Advances in Neural Information Processing Systems (NeurIPS 2015), volume 28, pages 496-504. Curran Associates, Inc., 2015 (cited on page 15).
[25] J. Lee, V. S. Mirrokni, V. Nagarajan, and M. Sviridenko. Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM Journal on Discrete Mathematics, 23(4):2053-2078, 2010 (cited on page 4).
[26] Y. T. Lee, A. Sidford, and S. C.-W. Wong. A faster cutting plane method and its implications for combinatorial and convex optimization. In Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS 2015), pages 1049-1065, 2015 (cited on page 15).
[27] A. Lindermayr and N. Megow. https://algorithms-with-predictions.github.io/ (cited on page 3).
[28] T. Lykouris and S. Vassilvitskii. Competitive caching with machine learned advice. Journal of the ACM, 68(4):1-25, 2021 (cited on page 2).
[29] M. Mitzenmacher and S. Vassilvitskii. Algorithms with predictions. In Beyond the Worst-Case Analysis of Algorithms, pages 646–662. Cambridge University Press, Cambridge, 2021 (cited on pages 1, 2).
[30] S. Moriguchi, A. Shioura, and N. Tsuchimura. M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm. SIAM Journal on Optimization, 21(3):633–668, 2011 (cited on pages 3, 6, 8, 9, 15).
[31] K. Murota. Discrete Convex Analysis, volume 10 of Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 2003 (cited on pages 1, 3-6, 14).
[32] G. L. Nemhauser and L. A. Wolsey. Best algorithms for approximating the maximum of a submodular set function. Mathematics of Operations Research, 3(3):177-188, 1978 (cited on page 4).
[33] F. Orabona. A Modern Introduction to Online Learning. OpenBU, 2020 (cited on page 5).
[34] J. B. Orlin and B. Vaidyanathan. Fast algorithms for convex cost flow problems on circles, lines, and trees. Networks, 62(4):288-296, 2013 (cited on page 2).
[35] A. Polak and M. Zub. Learning-augmented maximum flow. arXiv:2207.12911, 2022 (cited on pages 1, 3, 4).
[36] M. Purohit, Z. Svitkina, and R. Kumar. Improving online algorithms via ML predictions. In Advances in Neural Information Processing Systems (NeurIPS 2018), volume 31, pages 9684-9693. Curran Associates, Inc., 2018 (cited on page 2).
[37] R. T. Rockafellar. Convex Analysis, volume 13 of Princeton Landmarks in Mathematics and Physics. Princeton University Press, Princeton, 1970 (cited on page 7).
[38] T. Roughgarden. Beyond the Worst-Case Analysis of Algorithms. Cambridge University Press, Cambridge, 2021 (cited on page 2).
[39] S. Sakaue and T. Oki. Discrete-convex-analysis-based framework for warm-starting algorithms with predictions. In Advances in Neural Information Processing Systems (NeurIPS 2022), volume 35, pages 20988–21000. Curran Associates, Inc., 2022 (cited on pages 1–5).