An Item Collecting Problem with Arc Reversing in a Directed Bipartite Graph

Abstract

A variant of 0-1 knapsack problem in graph structure is considered. Given a directed bipartite structure with a set of items and a set of players, the problem asks to find an arc reversing strategy of the players which collects items in their cooperation with a budget constraint so that the total profit of the collected items is maximized. The problem is also viewed as a generalization of an integrated circuit design problem. Two greedy heuristic algorithms are designed for the problem, and numerical experiments are conducted to demonstrate the performance.