Constrained Monotone k -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee

The problem of maximizing monotone <inline-formula> <tex-math notation="LaTeX">{k} </tex-math></inline-formula>-submodular functions under a size constraint arises in many applications, and it is NP-hard. In this paper, we propose a new approach which employs a mult...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on evolutionary computation Ročník 22; číslo 4; s. 595 - 608
Hlavní autori:	Qian, Chao, Shi, Jing-Cheng, Tang, Ke, Zhou, Zhi-Hua
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.08.2018
Predmet:	Constrained optimization Electronic mail Evolutionary computation experimental studies Greedy algorithms Integrated circuit modeling Method of moments multiobjective evolutionary algorithms (MOEAs) Optimization submodular optimization theoretical analysis
ISSN:	1089-778X, 1941-0026
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!