The Knapsack Problem with Forfeits

In this paper we introduce and study the Knapsack Problem with Forfeits. With respect to the classical definition of the problem, we are given a collection of pairs of items, such that the inclusion of both in the solution involves a reduction of the profit. We propose a mathematical formulation and two heuristic algorithms for the problem. Computational results validate the effectiveness of our approaches.

[1]  Raffaele Cerulli,et al.  Carousel greedy: A generalized greedy algorithm with applications in optimization , 2017, Comput. Oper. Res..

[2]  Carmine Cerrone,et al.  Heuristics for the strong generalized minimum label spanning tree problem , 2019, Networks.

[3]  Ulrich Pferschy,et al.  The Maximum Flow Problem with Conflict and Forcing Conditions , 2011, INOC.

[4]  Leah Epstein,et al.  On Bin Packing with Conflicts , 2008, SIAM J. Optim..

[5]  Sebastián Urrutia,et al.  A branch and cut algorithm for minimum spanning trees under conflict constraints , 2013, Optim. Lett..

[6]  Francesco Carrabs,et al.  Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints , 2017, GPC.

[7]  Abraham P. Punnen,et al.  The minimum spanning tree problem with conflict constraints and its variations , 2011, Discret. Optim..

[8]  Ruslan Sadykov,et al.  Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm , 2013, INFORMS J. Comput..

[9]  Valentina Cacchiani,et al.  A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph , 2017, INFORMS J. Comput..

[10]  Michel Gendreau,et al.  Heuristics and lower bounds for the bin packing problem with conflicts , 2004, Comput. Oper. Res..

[11]  Ciriaco D’Ambrosio,et al.  Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints , 2017 .

[12]  Frank Gurski,et al.  The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width , 2018, OR.

[13]  Christian Laforest,et al.  Trees in Graphs with Conflict Edges or Forbidden Transitions , 2013, TAMC.

[14]  Ulrich Pferschy,et al.  Approximation of knapsack problems with conflict and forcing graphs , 2016, Journal of Combinatorial Optimization.

[15]  Raffaele Cerulli,et al.  Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach , 2018 .

[16]  Ulrich Pferschy,et al.  The Knapsack Problem with Conflict Graphs , 2009, J. Graph Algorithms Appl..

[17]  Mhand Hifi,et al.  An algorithm for the disjunctively constrained knapsack problem , 2012 .

[18]  Wenquan Li,et al.  A hybrid iterated carousel greedy algorithm for community detection in complex networks , 2019 .

[19]  Paolo Toth,et al.  Algorithms for the Bin Packing Problem with Conflicts , 2010, INFORMS J. Comput..