Evolutionary submodular optimisation-Reference-Cited by-同舟云学术

Evolutionary submodular optimisation

Published:2022-07-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference Companion
language:
Short-container-title:

Author:

Neumann Aneta¹,Neumann Frank¹,Qian Chao²

Affiliation:

1. The University of Adelaide, Australia

2. Nanjing University, China

Funder

Australian Research Council

South Australian Government

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3520304.3533624

Reference45 articles.

1. Submodular functions and convexity

2. G. L. Nemhauser , L. A. Wolsey and M. L. Fisher . An analysis of approximations for maximizing submodular set functions - I . Mathematical Programming , 1978 , 14(1): 265--294. G. L. Nemhauser, L. A. Wolsey and M. L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming, 1978, 14(1): 265--294.

3. Non-monotone submodular maximization under matroid and knapsack constraints

4. T. Friedrich , F. Neumann: Maximizing Submodular functions under matroid vonstraints by evolutionary algorithms. Evolutionary Computation 23(4) , MIT Press , 543--558, 2015 . T. Friedrich, F. Neumann: Maximizing Submodular functions under matroid vonstraints by evolutionary algorithms. Evolutionary Computation 23(4), MIT Press, 543--558, 2015.

5. Maximizing the spread of influence through a social network

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. General Boolean Function Benchmark Suite;Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms;2023-08-30