Efficient algorithms for orthogonal packing problems

DOI10.1134/S0965542513100047zbMath1299.90278MaRDI QIDQ5413218

A. V. Chekanin, V. A. Chekanin

Publication date: 28 April 2014

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

genetic algorithmpacking problemsorthogonal packingsingle-pass heuristic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

Cites Work

• Unnamed Item
• Unnamed Item
• Multialternative genetic algorithms for the search of a function extremum
• New lower bounds for the three-dimensional finite bin packing problem
• Two-dimensional packing problems: a survey
• Heuristic algorithms for the three-dimensional bin packing problem
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• The Three-Dimensional Bin Packing Problem
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

This page was built for publication: Efficient algorithms for orthogonal packing problems