Bin Packing Problems (Promising Models and Examples)


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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


Copyright (c) 2018 Pleiades Publishing, Inc.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies