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

Authors:
M. A. Mesyagutov;E. A. Mukhacheva;G. N. Belov;G. Scheithauer
Affiliations:
Ufa State Aviation Technical University, Ufa, Russia;Ufa State Aviation Technical University, Ufa, Russia;Technical University of Dresden, Dresden, Germany;Technical University of Dresden, Dresden, Germany
Venue:
Automation and Remote Control
Year:
2011

Citing 9
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems

Artificial Intelligence Review
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Rectangular Packing Problem: Local Optimum Search Methods Based on Block Structures

Automation and Remote Control
An Exact Approach to the Strip-Packing Problem

INFORMS Journal on Computing
Design of rectangular packings: Block structure-based reconstruction algorithm

Automation and Remote Control
Local search of orthogonal packings using the lower bounds

Automation and Remote Control
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

LP bounds in various constraint programming approaches for orthogonal packing

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.