The Knapsack Problem with Conflict Graphs

We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conict graph whose vertices correspond to the items of the knapsack problem. Similar conditions were treated in the literature for bin packing and scheduling problems. For the knapsack problem with conict graphs, exact and heuristic algorithms were proposed in the past. While the problem is strongly NP-hard in general, we present pseudopolynomial algorithms for two special graph classes, namely graphs of bounded treewidth (including trees and series-parallel graphs) and chordal graphs. From these algorithms we can easily derive fully polynomial time approximation schemes (FPTAS).

[1]  Mhand Hifi,et al.  Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem , 2007, Comput. Oper. Res..

[2]  Klaus Jansen,et al.  On the Complexity of Scheduling Incompatible Jobs with Unit-Times , 1993, MFCS.

[3]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[4]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

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

[6]  Klaus Jansen,et al.  Approximation Algorithms for Time Constrained Scheduling , 1995, IRREGULAR.

[7]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[8]  Edward G. Coffman,et al.  Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..

[9]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[10]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[11]  Klaus Jansen.  An Approximation Scheme for Bin Packing with Conflicts , 1999, J. Comb. Optim..

[12]  Klaus Jansen,et al.  Scheduling with Incompatible Jobs , 1992, WG.

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

[14]  Leah Epstein,et al.  Two-dimensional packing with conflicts , 2007, Acta Informatica.

[15]  Mhand Hifi,et al.  A reactive local search-based algorithm for the disjunctively constrained knapsack problem , 2006, J. Oper. Res. Soc..

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

[17]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[18]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[19]  Takeo Yamada,et al.  Heuristic and Exact Algorithms for the Disjunctively Constrained Knapsack Problem , 2002 .

[20]  Kirk Pruhs,et al.  Approximation schemes for a class of subset selection problems , 2007, Theor. Comput. Sci..

[21]  Vangelis Th. Paschos.  Combinatorial Optimization and Theorical Computer Science: Interfaces and Perspectives , 2008 .

[22]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[23]  Michel Habib,et al.  Chordal Graphs and Their Clique Graphs , 1995, WG.