Local Optimum

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 6 in Computational Aspects of Social Networks, 2026, pp 185-215 from Springer

Abstract: Abstract Many optimization problems in social networks are nonsubmodular optimization. In the study of nonsubmodular optimization, it is unlikely to be able efficiently to compute global optimal solution. Therefore, we have to move our attention to local optimal solution.

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_6

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

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

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 ().