Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Linyun Liao"'
Publikováno v:
Computers & Operations Research. 127:105140
We address a new packing problem variant known as the 2D circle bin packing problem (2D-CBPP), which involves packing circles into multiple square bins as densely as possible so as to minimize the number of bins used. To this end, we propose an adapt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a64decf1fffcc555a0f27e074d3a258
https://doi.org/10.1016/j.cor.2020.105140
https://doi.org/10.1016/j.cor.2020.105140
