IDEAS home Printed from https://ideas.repec.org/p/gro/rugsom/99a17.html
   My bibliography  Save this paper

The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm

Author

Listed:
  • Goldengorin, Boris
  • Tijssen, Gert A.
  • Tso, Michael

    (Groningen University)

Abstract

The first purpose of this paper is to make an old (Russian) theoretical results about the structure of local and global maxima of submodular functions, Cherenin’s excluding rules and his Dichotomy Algorithm more accessible for Western community. The second purpose of this paper is to present our main result which can be stated as follows. For any pair of embedded subsets, the difference of their function values is a lower bound for the difference between the unknown(!) optimal values of the corresponding partition defined by these subsets. A simple justification of Cherenin’s rules, the Dichotomy Algorithmand its generalization with the new branching rules from our main result are presented. The usefulness of our new branching rules is illustrated by means of a numerical example.

Suggested Citation

  • Goldengorin, Boris & Tijssen, Gert A. & Tso, Michael, 1999. "The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm," Research Report 99A17, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    • Handle: RePEc:gro:rugsom:99a17
    as

    Download full text from publisher

    File URL: http://irs.ub.rug.nl/ppn/183932617
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Boris Goldengorin & Gerard Sierksma & Gert A. Tijssen & Michael Tso, 1999. "The Data-Correcting Algorithm for the Minimization of Supermodular Functions," Management Science, INFORMS, vol. 45(11), pages 1539-1551, November.
    3. Chun-Wa Ko & Jon Lee & Maurice Queyranne, 1995. "An Exact Algorithm for Maximum Entropy Sampling," Operations Research, INFORMS, vol. 43(4), pages 684-691, August.
    4. Francisco Barahona & Martin Grötschel & Michael Jünger & Gerhard Reinelt, 1988. "An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design," Operations Research, INFORMS, vol. 36(3), pages 493-513, June.
    5. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.
    6. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Jon Lee, 1998. "Constrained Maximum-Entropy Sampling," Operations Research, INFORMS, vol. 46(5), pages 655-664, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. repec:dgr:rugsom:99a17 is not listed on IDEAS
    2. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
    3. Boris Goldengorin & Gerard Sierksma & Gert A. Tijssen & Michael Tso, 1999. "The Data-Correcting Algorithm for the Minimization of Supermodular Functions," Management Science, INFORMS, vol. 45(11), pages 1539-1551, November.
    4. Goldengorin, Boris & Sierksma, Gerard & Tijssen, Gert A., 1998. "The data-correcting algorithm for supermodular functions, with applications to quadratic cost partition and simple plant location problems," Research Report 98A08, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    5. Goldengorin, Boris & Ghosh, Diptesh, 2004. "A Multilevel Search Algorithm for the Maximization of Submodular Functions," Research Report 04A20, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    6. repec:dgr:rugsom:99a50 is not listed on IDEAS
    7. Goldengorin, Boris & Vink, Marius de, 1999. "Solving large instances of the quadratic cost of partition problem on dense graphs by data correcting algorithms," Research Report 99A50, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    8. repec:dgr:rugsom:98a08 is not listed on IDEAS
    9. repec:dgr:rugsom:04a20 is not listed on IDEAS
    10. Hessa Al-Thani & Jon Lee, 2020. "An R Package for Generating Covariance Matrices for Maximum-Entropy Sampling from Precipitation Chemistry Data," SN Operations Research Forum, Springer, vol. 1(3), pages 1-21, September.
    11. Mohit Singh & Weijun Xie, 2020. "Approximation Algorithms for D -optimal Design," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1512-1534, November.
    12. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    13. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    14. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    15. Guanyi Wang, 2024. "Robust Network Targeting with Multiple Nash Equilibria," Papers 2410.20860, arXiv.org, revised Nov 2024.
    16. Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 516-543, February.
    17. Goldengorin, Boris, 2001. "Solving the simple plant location problem using a data correcting approach," Research Report 01A53, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    18. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    19. Mohammad Abouei Mehrizi & Federico Corò & Emilio Cruciani & Gianlorenzo D’Angelo, 2022. "Election control through social influence with voters’ uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 635-669, August.
    20. Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
    21. Suning Gong & Qingqin Nong & Shuyu Bao & Qizhi Fang & Ding-Zhu Du, 2023. "A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice," Journal of Global Optimization, Springer, vol. 85(1), pages 15-38, January.
    22. Emily M. Craparo & Mumtaz Karatas & Tobias U. Kuhn, 2017. "Sensor placement in active multistatic sonar networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 287-304, June.
    23. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    24. Oded Berman & Dmitry Krass & Mozart B. C. Menezes, 2007. "Facility Reliability Issues in Network p -Median Problems: Strategic Centralization and Co-Location Effects," Operations Research, INFORMS, vol. 55(2), pages 332-350, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gro:rugsom:99a17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Hanneke Tamling (email available below). General contact details of provider: https://edirc.repec.org/data/ferugnl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.