Hello, I am searching for a benchmark on the distributed generalized assignment problem (D-GAP). Does anybody know such a benchmark-set? Thanks for the help in advance.
Thank you for your support. I search for benchmraks in which not each item can be put into each bin. So I specially search for benchmarks which a sparse profit-map. This might not be entirely clear in the way I asked my question. But thank you for reading it and helping me.