On a generalized problem of bin packing

Nguyen Trong


A generalization of the bin packing problem, called the DTMR problem is studied.

The NP-completeness of  DTMR is proved.

Three heuristic algorithms-the CNN, the CHT and the CSX are described and the worst-case analysis of them are given.

Some applications of the DTMR are shown.

Full Text:


DOI: https://doi.org/10.15625/1813-9663/1/2/6674

Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology