IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-08623-6_15.html
   My bibliography  Save this book chapter

The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs

In: Operations Research Proceedings 2021

Author

Listed:
  • Steffen Goebbels

    (Niederrhein University of Applied Sciences)

  • Frank Gurski

    (University of Düsseldorf)

  • Dominique Komander

    (University of Düsseldorf)

Abstract

The knapsack problem is one of the best known and most fundamental NP-hard problems in combinatorial optimization. We consider two knapsack problems which contain additional constraints in the form of directed graphs whose vertex set corresponds to the item set. In the 1-neighbor knapsack problem, an item can be chosen only if at least one of its successors is chosen. In the all-neighbors knapsack problem, an item can be chosen only if all of its successors are chosen. For both problems, we consider uniform and general profits and weights. Since all these problems generalize the knapsack problem, they are NP-hard. This motivates us to consider the problem on special graph classes. Therefore, we restrict these problems to directed co-graphs, i.e., directed complement reducible graphs, that are precisely those digraphs which can be defined from the single vertex graph by applying the disjoint union, order and series composition. We show polynomial time solutions for the uniform problems on directed co-graphs and pseudo-polynomial time solutions for the general problems on directed co-graphs. These results improve known worst-case runtimes in comparison to constraints given by unrestricted digraphs.

Suggested Citation

  • Steffen Goebbels & Frank Gurski & Dominique Komander, 2022. "The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs," Lecture Notes in Operations Research, in: Norbert Trautmann & Mario Gnägi (ed.), Operations Research Proceedings 2021, pages 95-100, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-08623-6_15
    DOI: 10.1007/978-3-031-08623-6_15
    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.

    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:lnopch:978-3-031-08623-6_15. 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.