Polynomiality for Bin Packing with a Constant Number of Item Types
© 2020 ACM. We consider the bin packing problem with d different item sizes si and item multiplicities ai, where all numbers are given in binary encoding. This problem formulation is also known as the one-dimensional cutting stock problem. In this work, we provide an algorithm that, for constant d,...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/133285 |
Search Result 1
Polynomiality for Bin Packing with a Constant Number of Item Types
Published 2022
Get full text
Article
Search Result 2
Get full text
Polynomiality for Bin Packing with a Constant Number of Item Types
Published 2015
Get full text
Get full text
Article