Nonsubmodular Optimization

Weili Wu (), Zhao Zhang and Ding-Zhu Du ()
Additional contact information
Weili Wu: University of Texas at Dallas, Department of Computer Science
Zhao Zhang: Zhejiang Normal University, School of Mathematics
Ding-Zhu Du: University of Texas at Dallas, Department of Computer Science

Chapter Chapter 5 in Computational Aspects of Social Networks, 2026, pp 151-184 from Springer

Abstract: Abstract In recent developments of information technologies, many new types of optimization problems appear which motivate many new research subjects in optimization theory. Especially, in viral marketing, there exist many problems whose objective functions are neither submodular nor supermodular. Those problems encourage us to extend our study from the submodular optimization to the nonsubmodular optimization. This extension requires new methodologies. In this chapter, we discuss two of them, the sandwich method and the parameterized method.

Date: 2026
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-032-14833-9_5

Ordering information: This item can be ordered from
http://www.springer.com/9783032148339

DOI: 10.1007/978-3-032-14833-9_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().