IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/486.html
   My bibliography  Save this paper

Maximising real-valued submodular functions: primal and dual heuristics for location problems

Author

Listed:
  • WOLSEY, Laurence A.

Abstract

No abstract is available for this item.

Suggested Citation

  • WOLSEY, Laurence A., 1982. "Maximising real-valued submodular functions: primal and dual heuristics for location problems," LIDAM Reprints CORE 486, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:486
    DOI: 10.1287/moor.7.3.410
    Note: In : Mathematics of Operations Research, 7(3), 410-425, 1982
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Simai He & Jiawei Zhang & Shuzhong Zhang, 2012. "Polymatroid Optimization, Submodularity, and Joint Replenishment Games," Operations Research, INFORMS, vol. 60(1), pages 128-137, February.
    2. Ivan Contreras & Elena Fernández, 2014. "Hub Location as the Minimization of a Supermodular Set Function," Operations Research, INFORMS, vol. 62(3), pages 557-570, June.
    3. 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.
    4. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
    5. Canh V. Pham & Quang C. Vu & Dung K. T. Ha & Tai T. Nguyen & Nguyen D. Le, 2022. "Maximizing k-submodular functions under budget constraint: applications and streaming algorithms," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 723-751, August.
    6. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian, 2021. "Maximizing Sequence-Submodular Functions and Its Application to Online Advertising," Management Science, INFORMS, vol. 67(10), pages 6030-6054, October.
    7. Canh V. Pham, 2025. "Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity," Journal of Combinatorial Optimization, Springer, vol. 49(1), pages 1-14, January.

    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:cor:louvrp:486. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.