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

DOI10.1134/S0005117911010127MaRDI QIDQ664176zbMATH OpenFDO

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

Publication date 29 February 2012

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0005117911010127

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Exact solution of the two-dimensional finite bin packing problem
• An improved lower bound for the bin packing problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• scientific article; zbMATH DE number 3950202
• A new exact method for the two-dimensional bin-packing problem with fixed orientation

Cites work

• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• An exact approach to the strip-packing problem
• Design of rectangular packings: Block structure-based reconstruction algorithm
• Exact solution of the two-dimensional finite bin packing problem
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Local search of orthogonal packings using the lower bounds
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The rectangular packing problem: local optimum search methods based on block structures
• Two-Dimensional Finite Bin-Packing Algorithms

Cited in

(7)

• LP bounds in various constraint programming approaches for orthogonal packing
• Exact solution techniques for two-dimensional cutting and packing
• Two-bar charts packing problem
• Combinatorial Benders' cuts for the strip packing problem
• scientific article; zbMATH DE number 3950202 (Why is no real title available?)
• The solution of packing problems with pieces variable length and additional allocation constraints
• Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies

This page was built for publication: Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q664176)