A Synchronized Knapsack Problem - CNRS - Centre national de la recherche scientifique Access content directly
Proceedings Year : 2022

A Synchronized Knapsack Problem


We describe here a bi-level Knapsack problem which involves an Eater/Feeder interaction between 2 Knapsack systems. This kind of problem may for instance express the collaboration between a local energy provider and an industrial 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. According to this purpose 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
No file

Dates and versions

hal-04047547 , version 1 (27-03-2023)



Fatiha Bendali, Jean Mailfert, E. Mole Kamga, A. Quilliot, H. Toussaint. A Synchronized Knapsack Problem. IEEE, pp.687-692, 2022, ⟨10.1109/CoDIT55151.2022.9803883⟩. ⟨hal-04047547⟩
37 View
0 Download



Gmail Facebook X LinkedIn More