Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution

M. A. Mesyagutov, E. A. Mukhacheva, G. N. Belov, G. Scheithauer

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Consideration was given to the one-dimensional bin packing problem under the conditions for heterogeneity of the items put into bins and contiguity of choosing identical items for the next bin. The branch-and-bound method using the "next fit" principle and the "linear programming" method were proposed to solve it. The problem and its solution may be used to construct an improved lower bound in the problem of two-dimensional packing.

Original languageEnglish
Pages (from-to)141-159
Number of pages19
JournalAutomation and Remote Control
Volume72
Issue number1
DOIs
Publication statusPublished - 2011
Externally publishedYes

Cite this

@article{e65207cc94484cfb901ac7cd876ef20d,
title = "Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution",
abstract = "Consideration was given to the one-dimensional bin packing problem under the conditions for heterogeneity of the items put into bins and contiguity of choosing identical items for the next bin. The branch-and-bound method using the {"}next fit{"} principle and the {"}linear programming{"} method were proposed to solve it. The problem and its solution may be used to construct an improved lower bound in the problem of two-dimensional packing.",
author = "Mesyagutov, {M. A.} and Mukhacheva, {E. A.} and Belov, {G. N.} and G. Scheithauer",
year = "2011",
doi = "10.1134/S0005117911010127",
language = "English",
volume = "72",
pages = "141--159",
journal = "Automation and Remote Control",
issn = "0005-1179",
publisher = "MAIK Nauka/Interperiodica",
number = "1",

}

Packing of one-dimensional bins with contiguous selection of identical items : An exact method of optimal solution. / Mesyagutov, M. A.; Mukhacheva, E. A.; Belov, G. N.; Scheithauer, G.

In: Automation and Remote Control, Vol. 72, No. 1, 2011, p. 141-159.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Packing of one-dimensional bins with contiguous selection of identical items

T2 - An exact method of optimal solution

AU - Mesyagutov, M. A.

AU - Mukhacheva, E. A.

AU - Belov, G. N.

AU - Scheithauer, G.

PY - 2011

Y1 - 2011

N2 - Consideration was given to the one-dimensional bin packing problem under the conditions for heterogeneity of the items put into bins and contiguity of choosing identical items for the next bin. The branch-and-bound method using the "next fit" principle and the "linear programming" method were proposed to solve it. The problem and its solution may be used to construct an improved lower bound in the problem of two-dimensional packing.

AB - Consideration was given to the one-dimensional bin packing problem under the conditions for heterogeneity of the items put into bins and contiguity of choosing identical items for the next bin. The branch-and-bound method using the "next fit" principle and the "linear programming" method were proposed to solve it. The problem and its solution may be used to construct an improved lower bound in the problem of two-dimensional packing.

UR - http://www.scopus.com/inward/record.url?scp=79551519952&partnerID=8YFLogxK

U2 - 10.1134/S0005117911010127

DO - 10.1134/S0005117911010127

M3 - Article

VL - 72

SP - 141

EP - 159

JO - Automation and Remote Control

JF - Automation and Remote Control

SN - 0005-1179

IS - 1

ER -