Bin Packing Problems (Promising Models and Examples)
- 作者: Levin M.1
-
隶属关系:
- Kharkevich Institute for Information Transmission Problems
- 期: 卷 63, 编号 6 (2018)
- 页面: 655-666
- 栏目: Information Technology in Engineering Systems
- URL: https://journals.rcsi.science/1064-2269/article/view/199903
- DOI: https://doi.org/10.1134/S1064226918060177
- ID: 199903
如何引用文章
详细
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.
作者简介
M. Levin
Kharkevich Institute for Information Transmission Problems
编辑信件的主要联系方式.
Email: mslevin@acm.org
俄罗斯联邦, Moscow, 127994