Two-Dimensional Finite Bin-Packing Algorithms
From MaRDI portal
Publication:3751379
DOI10.2307/2582731zbMath0611.90079MaRDI QIDQ3751379
No author found.
Publication date: 1987
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2582731
Related Items
Data set generation for rectangular placement problems, Recent advances on two-dimensional bin packing problems, A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, Reactive GRASP for the strip-packing problem, Simulated annealing for manufacturing systems layout design, Approximation algorithm for the oriented two-dimensional bin packing problem, A typology of cutting and packing problems, New lower bounds for the three-dimensional finite bin packing problem, Two-dimensional packing problems: a survey, The nesting problem in the leather manufacturing industry, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, Design of rectangular packings using decoders of block structure, A new exact method for the two-dimensional bin-packing problem with fixed orientation, A new lower bound for the non-oriented two-dimensional bin-packing problem, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, A new heuristic recursive algorithm for the strip rectangular packing problem, The two-dimensional bin packing problem with variable bin sizes and costs, A new exact method for the two-dimensional orthogonal packing problem, Models and algorithms for three-stage two-dimensional bin packing, Analysis of distributed genetic algorithms for solving cutting problems
