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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The Proceedings of Manufacturing Systems Division Conference
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
