Facets of Knapsack Polytopes with Bipartite Precedence Constraints

이분할성 우선순위제약을 갖는 배낭문제에 대한 다면체적 절단평면

We consider the precedence-constrained knapsack problem. which is a knapsack problem with precedence constraints imposed on the set of variables. Especially, we focus on the case where the precedence constraints cir be represented as a bipartite graph, which occurs most frequently in applications. Based on the previous studios for the general case, we specialize the polyhedral results on the related polytope and derive stronger results on the facet-defining properties of the inequalities.