IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v89y2019i3d10.1007_s00186-019-00664-y.html
   My bibliography  Save this article

Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width

Author

Listed:
  • Frank Gurski

    (University of Düsseldorf)

  • Carolin Rehs

    (University of Düsseldorf)

Abstract

The 0–1-knapsack problem is a well-known NP-hard problem in combinatorial optimization. We consider the extensions to the knapsack problem with conflict graph (KCG) and the knapsack problem with forcing graph (KFG). KCG has first been introduced by Yamada et al. and represents incompatibilities between items of the knapsack instance. KFG has been introduced by Pferschy and Schauer and represents the necessity of items for other items. Within this paper we provide pseudo-polynomial solutions for KCG and KFG with co-graphs as conflict and forcing graphs and extend these solutions to conflict and forcing graphs of bounded clique-width. Our solutions are based on dynamic programming using the tree-structure representing the conflict graph and the forcing graph. Further we conclude fully polynomial time approximation schemes for KCG on conflict graphs of bounded clique-width and KFG on forcing graphs of bounded clique-width. This generalizes the known results for conflict graphs and forcing graphs of bounded tree-width of Pferschy and Schauer.

Suggested Citation

  • Frank Gurski & Carolin Rehs, 2019. "Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 411-432, June.
    • Handle: RePEc:spr:mathme:v:89:y:2019:i:3:d:10.1007_s00186-019-00664-y
    DOI: 10.1007/s00186-019-00664-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-019-00664-y
    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/s00186-019-00664-y?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.

    References listed on IDEAS

    as
    1. Frank Gurski & Carolin Rehs, 2019. "The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 259-265, Springer.
    2. Ulrich Pferschy & Joachim Schauer, 2017. "Approximation of knapsack problems with conflict and forcing graphs," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1300-1323, May.
    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. Luiz Viana & Manoel Campêlo & Ignasi Sau & Ana Silva, 2021. "A unifying model for locally constrained spanning tree problems," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 125-150, July.
    2. Frank Gurski & Carolin Rehs, 2020. "Counting and enumerating independent sets with applications to combinatorial optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(3), pages 439-463, June.
    3. Wei, Zequn & Hao, Jin-Kao & Ren, Jintong & Glover, Fred, 2023. "Responsive strategic oscillation for solving the disjunctively constrained knapsack problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 993-1009.

    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. Wei, Zequn & Hao, Jin-Kao & Ren, Jintong & Glover, Fred, 2023. "Responsive strategic oscillation for solving the disjunctively constrained knapsack problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 993-1009.
    2. Frank Gurski & Carolin Rehs, 2020. "Counting and enumerating independent sets with applications to combinatorial optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(3), pages 439-463, June.
    3. Luiz Viana & Manoel Campêlo & Ignasi Sau & Ana Silva, 2021. "A unifying model for locally constrained spanning tree problems," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 125-150, July.
    4. Steffen Goebbels & Frank Gurski & Dominique Komander, 2022. "The knapsack problem with special neighbor constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(1), pages 1-34, February.

    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:mathme:v:89:y:2019:i:3:d:10.1007_s00186-019-00664-y. 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: 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.