[6] B. Doerr and Z. Qu, "A first runtime analysis of the NSGA-II on a multimodal problem," IEEE Transactions on Evolutionary Computation, pp. 1-1, 2023.
[7] B. Doerr and W. Zheng, "Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives," Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 14, pp. 12 293-12 301, May 2021.
[8] J. Edmonds, "Matroids and the greedy algorithm," Mathematical Programming, vol. 1, no. 1, pp. 127-136, Dec. 1971.
[9] D. Gale, "Optimal assignments in an ordered set: An application of matroid theory," Journal of Combinatorial Theory, vol. 4, no. 2, pp. 176-180, Mar. 1968.
[10] H. W. Hamacher and G. Ruhe, “On spanning tree problems with multiple objectives,” Annals of Operations Research, vol. 52, no. 4, pp. 209–230, Dec. 1994.
[11] P. Helman, B. M. E. Moret, and H. D. Shapiro, "An exact characterization of greedy structures," SIAM Journal on Discrete Mathematics, vol. 6, no. 2, pp. 274--283, May 1993.
[12] Z. Huang, Y. Zhou, Z. Chen, and X. He, "Running time analysis of MOEA/D with crossover on discrete optimization problem," Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, pp. 2296-2303, Jul. 2019.
[13] Z. Huang, Y. Zhou, Z. Chen, X. He, X. Lai, and X. Xia, "Running time analysis of MOEA/D on pseudo-boolean functions," IEEE Transactions on Cybernetics, vol. 51, no. 10, pp. 5130-5141, Oct. 2021.
[14] Z. Huang, Y. Zhou, C. Luo, and Q. Lin, "A runtime analysis of typical decomposition approaches in MOEA/D framework for many-objective optimization problems," in Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, Aug. 2021, pp. 1682-1688.
[15] H. Ishibuchi and T. Murata, "A multi-objective genetic local search algorithm and its application to flowshop scheduling," IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), vol. 28, no. 3, pp. 392-403, 1998.
[16] H. Ishibuchi, H. Masuda, Y. Tanigaki, and Y. Nojima, "Modified distance calculation in generational distance and inverted generational distance," in Evolutionary Multi-Criterion Optimization. Cham: Springer International Publishing, 2015, pp. 110-125.
[17] M. G. Kendall, “A new measure of rank correlation,” Biometrika, vol. 30, no. 1/2, pp. 81–93, Jun. 1938.
[18] F. Neumann, "Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem," European Journal of Operational Research, vol. 181, no. 3, pp. 1620-1629, Sep. 2007.
[19] F. Neumann and I. Wegener, "Randomized local search, evolutionary algorithms, and the minimum spanning tree problem," Theoretical Computer Science, vol. 378, no. 1, pp. 32-40, Jun. 2007.
[20] J. Oxley, Matroid Theory. Oxford University Press, Feb. 2011.
[21] C. Qian, Y. Yu, and Z.-H. Zhou, “Subset selection by pareto optimization,” in Advances in Neural Information Processing Systems, vol. 28. Curran Associates, Inc., 2015.
[22] C. Qian, J.-C. Shi, Y. Yu, K. Tang, and Z.-H. Zhou, "Subset selection under noise," in Advances in Neural Information Processing Systems, vol. 30. Curran Associates, Inc., 2017.
[23] C. Qian, C. Bian, and C. Feng, "Subset selection by pareto optimization with recombination," Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 03, pp. 2408-2415, Apr. 2020.
[24] R. Rado, “Note on independence functions,” Proceedings of the London Mathematical Society, vol. s3-7, no. 1, pp. 300–320, 1957.