Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Chia, Davin"'
In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be packed adjacently within a bin. We solve this problem for the case wher
Externí odkaz:
http://arxiv.org/abs/1511.04762
We study the Colored Bin Packing Problem: we are given a set of items where each item has a weight and color. We must pack the items in bins of uniform capacity such that no two items of the same color may be adjacent within in a bin. The goal is to
Externí odkaz:
http://arxiv.org/abs/1508.07380
Autor:
Linderman, Michael D.1 (AUTHOR) mlinderman@middlebury.edu, Chia, Davin1 (AUTHOR) davinchia@gmail.com, Wallace, Forrest1 (AUTHOR) forrest.wallace.vt@gmail.com, Nothaft, Frank A.2,3 (AUTHOR) frank.nothaft@databricks.com
Publikováno v:
BMC Bioinformatics. 10/11/2019, Vol. 20 Issue 1, p1-8. 8p.
