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

Maximizing submodular set functions: formulations and analysis of algorithms

Author

Listed:
  • NEMHAUSER, G.L.
  • WOLSEY, L.A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Nemhauser, G.L. & Wolsey, L.A., 1981. "Maximizing submodular set functions: formulations and analysis of algorithms," LIDAM Reprints CORE 455, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:455
    DOI: 10.1016/S0304-0208(08)73471-6
    Note: In : P. Hansen (ed.), Studies on Graphs and Discrete Programming. Amsterdam, North-Holland, 279-301, 1981
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1016/S0304-0208(08)73471-6
    Download Restriction: no
    File URL: https://libkey.io/10.1016/S0304-0208(08)73471-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Hao-Hsiang Wu & Simge Küçükyavuz, 2018. "A two-stage stochastic programming approach for influence maximization in social networks," Computational Optimization and Applications, Springer, vol. 69(3), pages 563-595, April.
    2. Billionnet, Alain, 2011. "Solving the probabilistic reserve selection problem," Ecological Modelling, Elsevier, vol. 222(3), pages 546-554.
    3. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2017. "Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 767-779, November.
    4. Güney, Evren & Leitner, Markus & Ruthmair, Mario & Sinnl, Markus, 2021. "Large-scale influence maximization via maximal covering location," European Journal of Operational Research, Elsevier, vol. 289(1), pages 144-164.
    5. Boaz Farbstein & Asaf Levin, 2017. "Maximum coverage problem with group budget constraints," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 725-735, October.
    6. Méndez-Vogel, Gonzalo & Marianov, Vladimir & Lüer-Villagra, Armin, 2023. "The follower competitive facility location problem under the nested logit choice rule," European Journal of Operational Research, Elsevier, vol. 310(2), pages 834-846.
    7. Hao Shen & Yong Liang & Zuo-Jun Max Shen, 2021. "Reliable Hub Location Model for Air Transportation Networks Under Random Disruptions," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 388-406, March.
    8. R. Garbe & K. D. Glazebrook, 1998. "Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems," Operations Research, INFORMS, vol. 46(3), pages 336-346, June.
    9. 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.
    10. Kurt Jörnsten & Andreas Klose, 2016. "An improved Lagrangian relaxation and dual ascent approach to facility location problems," Computational Management Science, Springer, vol. 13(3), pages 317-348, July.
    11. Ljubić, Ivana & Moreno, Eduardo, 2018. "Outer approximation and submodular cuts for maximum capture facility location problems with random utilities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 46-56.
    12. Benati, Stefano & Hansen, Pierre, 2002. "The maximum capture problem with random utilities: Problem formulation and algorithms," European Journal of Operational Research, Elsevier, vol. 143(3), pages 518-530, December.
    13. Jeffrey D. Camm & Susan K. Norman & Stephen Polasky & Andrew R. Solow, 2002. "Nature Reserve Site Selection to Maximize Expected Species Covered," Operations Research, INFORMS, vol. 50(6), pages 946-955, December.

    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:455. 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.