IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v88y2024i2d10.1007_s10898-023-01318-4.html
   My bibliography  Save this article

Constraint generation approaches for submodular function maximization leveraging graph properties

Author

Listed:
  • Eszter Csókás

    (University of Szeged)

  • Tamás Vinkó

    (University of Szeged)

Abstract

Submodular function maximization is an attractive optimization model and also a well-studied problem with a variety of algorithms available. Constraint generation (CG) approaches are appealing techniques to tackle the problem with, as the mixed-integer programming formulation of the problem suffers from the exponential size of the number of constraints. Most of the problems in these topics are of combinatorial nature and involve graphs on which the maximization is defined. Inspired by the recent work of Uematsu et al. (J Oper Res Soc Jpn 63:41–59, 2020), in this paper we introduce variants of the CG algorithm which take into account certain properties of the input graph aiming at informed selection of the constraints. Benchmarking results are shown to demonstrate the efficiency of the proposed methods.

Suggested Citation

  • Eszter Csókás & Tamás Vinkó, 2024. "Constraint generation approaches for submodular function maximization leveraging graph properties," Journal of Global Optimization, Springer, vol. 88(2), pages 377-394, February.
    • Handle: RePEc:spr:jglopt:v:88:y:2024:i:2:d:10.1007_s10898-023-01318-4
    DOI: 10.1007/s10898-023-01318-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01318-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-023-01318-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jglopt:v:88:y:2024:i:2:d:10.1007_s10898-023-01318-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.