Packing Compaction Algorithm for Rectangular Cutting and Orthogonal Packing Problems

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Proceedings of the 4th International Conference on Industrial Engineering

• Publication date

  2018-05-15

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-319-95630-5_201
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Development of Optimization Software to Solve Practical Packing and Cutting Problems

  2015cited by this paper
• An Efficient Model for the Orthogonal Packing Problem

  2015cited by this paper
• Effective Data Structure for the Multidimensional Orthogonal Bin Packing Problems

  2014cited by this paper
• Development of the Multimethod Genetic Algorithm for the Strip Packing Problem

  2014cited by this paper
• Improved Data Structure for the Orthogonal Packing Problem

  2014cited by this paper
• A biased random key genetic algorithm for 2D and 3D bin packing problems

  2013cited by this paper
• Constraints in container loading - A state-of-the-art review

  2013cited by this paper
• A hybrid evolutionary algorithm for the two-dimensional packing problem

  2013cited by this paper
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

  2012cited by this paper
• A MILP model for N-dimensional allocation

  2007cited by this paper
• An improved typology of cutting and packing problems

  2007cited by this paper
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing

  2006cited by this paper
• An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container

  2002cited by this paper
• Exact Solution of the Two-Dimensional Finite Bon Packing Problem

  1998cited by this paper
• Two-Dimensional Finite Bin-Packing Algorithms

  1987cited by this paper

• No citing papers are available for this paper.