Packing returning secretaries
Sign Up to like & getrecommendations! Published in 2021 at "Networks"
DOI: 10.1002/net.22000
Abstract: We study online secretary problems with returns in combinatorial packing domains with n candidates that arrive sequentially over time in random order. The goal is to determine a feasible packing of candidates of maximum total… read more here.
Keywords: returning secretaries; log; packing returning; candidate ... See more keywords