6 citations · 14 across the 9 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2019
The Ad Types Problem
Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers +1
The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are types of nodes on one side (the ads), and an ordered set of nodes on the…
cs.GT2009★ 1 cited
Parametric packing of selfish items and the subset sum algorithm
Leah Epstein, Elena Kleiman, Julian Mestre
The subset sum algorithm is a natural heuristic for the classical Bin Packing problem: In each iteration, the algorithm finds among the unpacked items, a maximum size set of items…