Zobrazeno 1 - 2
of 2
pro vyhledávání: '"91A68, 90C27"'
The Reward-Penalty-Selection Problem (RPSP) can be seen as a combination of the Set Cover Problem (SCP) and the Hitting Set Problem (HSP). Given a set of elements, a set of reward sets, and a set of penalty sets, one tries to find a subset of element
Externí odkaz:
http://arxiv.org/abs/2201.05515
The Reward-Penalty-Selection Problem (RPSP) can be seen as a combination of the Set Cover Problem (SCP) and the Hitting Set Problem (HSP). Given a set of elements, a set of reward sets, and a set of penalty sets, one tries to find a subset of element
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b19a82633a76ccf90e03b2387a4efcef
http://arxiv.org/abs/2201.05515
http://arxiv.org/abs/2201.05515