Zobrazeno 1 - 3
of 3
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
Autor:
Hao, Bainian1 (AUTHOR) bhao8@wisc.edu, Michini, Carla1 (AUTHOR)
Publikováno v:
Mathematical Programming. Jan2024, Vol. 203 Issue 1/2, p499-529. 31p.
