Constrained Monotone <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math> </inline-formula>-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee

Qian, Chao; Shi, Jing-Cheng; Tang, Ke; Zhou, Zhi-Hua

doi:10.1109/TEVC.2017.2749263

Record: found
Abstract: not found
Article: not found

Constrained Monotone <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math> </inline-formula>-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee

Author(s): Chao Qian , Jing-Cheng Shi , Ke Tang , Zhi-Hua Zhou

Publication date (Print): August 2018

Journal: IEEE Transactions on Evolutionary Computation

Publisher: Institute of Electrical and Electronics Engineers (IEEE)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 25

Record: found
Abstract: not found
Article: not found

An analysis of approximations for maximizing submodular set functions—I

G. L. Nemhauser, L. A. Wolsey, M. Fisher (1978)

0 comments Cited 563 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

An efficient constraint handling method for genetic algorithms

Kalyanmoy Deb (2000)

0 comments Cited 397 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

A threshold of ln n for approximating set cover

Uriel Feige (1998)

0 comments Cited 365 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Journal

Title: IEEE Transactions on Evolutionary Computation

Abbreviated Title: IEEE Trans. Evol. Computat.

Publisher: Institute of Electrical and Electronics Engineers (IEEE)

ISSN (Print): 1089-778X

ISSN (Electronic): 1941-0026

Publication date Created: August 2018

Publication date (Print): August 2018

Volume: 22

Issue: 4

Pages: 595-608

Article

DOI: 10.1109/TEVC.2017.2749263

SO-VID: 701e86ad-d2b3-4c63-ae56-af4e40f6ec17

History

Data availability:

Constrained Monotone <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math> </inline-formula>-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee

Read this article at

Related collections

Evolutionary Cell Biology

Most cited references 25

An analysis of approximations for maximizing submodular set functions—I

An efficient constraint handling method for genetic algorithms

A threshold of ln n for approximating set cover

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 2,680

Cited by 5

Most referenced authors 195