Two-Dimensional Finite Bin-Packing Algorithms
From MaRDI portal
Publication:3751379
DOI10.2307/2582731zbMath0611.90079OpenAlexW4245185805MaRDI 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
Algorithms for the two dimensional bin packing problem with partial conflicts, 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems, A hybrid heuristic algorithm for the 2D variable-sized bin packing problem, A block-based layer building approach for the 2D guillotine strip packing problem, Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem, A heuristic for solving large bin packing problems in two and three dimensions, Constrained order packing: comparison of heuristic approaches for a new bin packing problem, Sequential heuristic for the two-dimensional bin-packing problem, A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints, A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang, A hybrid algorithm based on variable neighbourhood for the strip packing problem, A variable neighborhood descent approach for the two-dimensional bin packing problem, Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, The nesting problem in the leather manufacturing industry, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, A new exact method for the two-dimensional orthogonal packing problem, Models and algorithms for three-stage two-dimensional bin packing, Logic based Benders' decomposition for orthogonal stock cutting problems, An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation, A simple randomized algorithm for two-dimensional strip packing, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, An exact strip packing algorithm based on canonical forms, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, Corner occupying theorem for the two-dimensional integral rectangle packing problem, A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem, Combinatorial Benders' Cuts for the Strip Packing Problem, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, An exact method for the 2D guillotine strip packing problem, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, Capping methods for the automatic configuration of optimization algorithms, Space defragmentation for packing problems, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, Generalized hyper-heuristics for solving 2D regular and irregular packing problems, Simulated annealing for manufacturing systems layout design, The off-line group seat reservation problem, Two dimensional guillotine cutting stock and scheduling problem in printing industry, An introduction to the two‐dimensional rectangular cutting and packing problem, Solving a large cutting problem in the glass manufacturing industry, Algorithms for nesting with defects, A squeaky wheel optimisation methodology for two-dimensional strip packing, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, A skyline heuristic for the 2D rectangular packing and strip packing problems, A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, The three-dimensional knapsack problem with balancing constraints, Packing, covering and tiling in two-dimensional spaces, Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution, Design of rectangular packings using decoders of block structure, Reactive GRASP for the strip-packing problem, A sequential value correction heuristic for a bi-objective two-dimensional bin-packing, 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 tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Recent advances on two-dimensional bin packing problems, Lower bounds for three-dimensional multiple-bin-size bin packing problems, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, A new heuristic recursive algorithm for the strip rectangular packing problem, New lower bounds for bin packing problems with conflicts, Data set generation for rectangular placement problems, The Two Dimensional Bin Packing Problem with Side Constraints, Exact solution techniques for two-dimensional cutting and packing, The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem, Number of bins and maximum lateness minimization in two-dimensional bin packing, Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints, An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem, The maximum diversity assortment selection problem, Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions, Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, An agent-based approach to the two-dimensional guillotine bin packing problem, Hybrid approach for the two-dimensional bin packing problem with two-staged patterns, Approximation algorithm for the oriented two-dimensional bin packing problem, Bidimensional packing by bilinear programming, A branch and bound algorithm for the strip packing problem, Deterministic model for customized pilot manufacture production with various backplane sizes, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, A branch-and-price algorithm for the two-dimensional level strip packing problem, One-dimensional relaxations and LP bounds for orthogonal packing, A hybrid metaheuristic for the two-dimensional strip packing problem, A typology of cutting and packing problems, New lower bounds for the three-dimensional finite bin packing problem, A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem, Local search of orthogonal packings using the lower bounds, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, The two-dimensional bin packing problem with variable bin sizes and costs, Analysis of distributed genetic algorithms for solving cutting problems, Two-dimensional packing problems: a survey, A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing, 2DPackLib: a two-dimensional cutting and packing library, Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
