Bin Packing Problems (Promising Models and Examples)
- Authors: Levin M.S.1
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems
- Issue: Vol 63, No 6 (2018)
- Pages: 655-666
- Section: Information Technology in Engineering Systems
- URL: https://journals.rcsi.science/1064-2269/article/view/199903
- DOI: https://doi.org/10.1134/S1064226918060177
- ID: 199903
Cite item
Abstract
The paper is devoted to the promising bin packing problems and some applications. A system view on the formulation of problems based on a set of elements (objects), a set of containers, and binary relations over the specified sets (precedence, dominance, and correspondence of elements to containers) is suggested. Special versions of packing problems with estimations of elements (objects) based on multisets are described. Examples in communication networks, such as the choice of information messages and two-dimensional packaging of messages in WiMAX systems are also briefly considered.
About the authors
M. Sh. Levin
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: mslevin@acm.org
Russian Federation, Moscow, 127994