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

DOI10.1134/S0005117911010127zbMath1233.90242MaRDI QIDQ664176

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

Publication date: 29 February 2012

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

Mathematics Subject Classification ID

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

Related Items (4)

Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Two-bar charts packing problem

Cites Work

• Unnamed Item
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• Design of rectangular packings: Block structure-based reconstruction algorithm
• Local search of orthogonal packings using the lower bounds
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• The rectangular packing problem: local optimum search methods based on block structures
• 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
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• An Exact Approach to the Strip-Packing Problem
• Two-Dimensional Finite Bin-Packing Algorithms
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing

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