A Fast Scalable Heuristic for Bin Packing
Data Structures and Algorithms
2019-04-30 v1 Optimization and Control
Abstract
In this paper we present a fast scalable heuristic for bin packing that partitions the given problem into identical sub-problems of constant size and solves these constant size sub-problems by considering only a constant number of bin configurations with bounded unused space. We present some empirical evidence to support the scalability of our heuristic and its tighter empirical analysis of hard instances due to improved lower bound on the necessary wastage in an optimal solution.
Cite
@article{arxiv.1904.12467,
title = {A Fast Scalable Heuristic for Bin Packing},
author = {Srikrishnan Divakaran},
journal= {arXiv preprint arXiv:1904.12467},
year = {2019}
}
Comments
16 pages. arXiv admin note: text overlap with arXiv:1902.03422