A Synchronized Knapsack Problem

Autor: Bendali, Fatiha, Mailfert, Jean, Kamga, E. Mole, Quilliot, A., Toussaint, H.
Přispěvatelé: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS)
Rok vydání: 2022
Předmět:
Zdroj: IEEE, pp.687-692, 2022, ⟨10.1109/CoDIT55151.2022.9803883⟩
DOI: 10.1109/codit55151.2022.9803883
Popis: 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
Databáze: OpenAIRE