Skip to main content
Log in

Supermodularity in Various Partition Problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Supermodular and submodular functions have attracted a great deal of attention since the seminal paper of Lovász. Recently, supermodular functions were studied in the context of some optimal partition problems. We completely answer a question arisen there whether a certain partition function is supermodular.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Gao, B., Hwang, F.K., Li, W.W.-C. and Rothblum, U.G. (1999), Partition polytopes over 1-dimensional points, Math. Prog. 85: 335-362.

    Google Scholar 

  2. Hwang, F.K. and Rothblum, U.G., Partitions: Clustering and Optimality, (in progress).

  3. Lovász, L., Submodular functions and complexity, in A. Bachem et al. (eds.), Mathematical Programming: The State of the Art, pp. 235-257.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hwang, F.K., Liao, M.M. & Chen, C. Supermodularity in Various Partition Problems. Journal of Global Optimization 18, 275–282 (2000). https://doi.org/10.1023/A:1008397707916

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008397707916

Navigation