Price-and-branch heuristic for vector bin packing
Vector bin packing is an NP-hard problem in which a set of item vectors must be packed into a minimum number of bins such that, in each bin, the sum of the vectors does not exceed the bin's vector capacity. Vector bin packing has many applications such as scheduling virtual machines in cloud co...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/28566158.v1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|