Multiple-type, two-dimensional bin packing problems: Applications and algorithms

DOI10.1007/BF02085642zbMath0815.90122MaRDI QIDQ1339128

Bernard T. Han, Jack S. Cook, George Diehr

Publication date: 27 June 1995

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

column generationsimulated annealingbranch and boundpackingtask assignmentfile assignmentbin sectioncomputer processor selection

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Fast machine reassignment, Vector bin packing with heterogeneous bins: application to the machine reassignment problem, Metaheuristics: A bibliography, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Lower bounds and algorithms for the 2-dimensional vector packing problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A comparison of heuristics and relaxations for the capacitated plant location problem
• Expected performance of the shelf heuristic for 2-dimensional packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• A 2.5 times optimal algorithm for packing in two dimensions
• Bin packing can be solved within 1+epsilon in linear time
• Lower bounds for on-line two-dimensional packing algorithms
• An algorithm for storage device selection and file assignment
• Packing problems
• Resource constrained scheduling as generalized bin packing
• Fast algorithms for bin packing
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• A Linear Programming Approach to the Cutting-Stock Problem
• Multiprogram scheduling
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Shelf Algorithms for Two-Dimensional Packing Problems
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• New Algorithms for Bin Packing
• Two-dimensional packing: expected performance of simple level algorithms
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A algorithm for two-dimensional packing
• On Packing Two-Dimensional Bins
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Multidimensional Optimal Bin Packing with Items of Random Size
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions