Abstract
We describe here a bi-level Knapsack problem which involves an Eater/Feeder interaction between 2 Knapsack systems and expresses the collaboration between a local resource provider and a consumer. We first describe the SFEK: Synchronized Feeder/Eater Knapsack problem in an accurate way, and set an ILP model, enhanced with additional valid cuts. Next we focus on the complexity issue. We design a Dynamic Programming algorithm which allows us to state that SFEK is pseudo-polynomial and derive for this problem a polynomial time approximation scheme. We conclude with a brief discussion about the Collaborative issue.
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 callDisclaimer: 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.
