Two-Dimensional Finite Bin-Packing Algorithms
From MaRDI portal
Publication:3751379
Recommendations
- Exact solution of the two-dimensional finite bin packing problem
- GENERALIZED FIRST-FIT ALGORITHMS IN TWO AND THREE DIMENSIONS
- Two-dimensional packing problems: a survey
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- Sequential heuristic for the two-dimensional bin-packing problem
Cited In (only showing first 100 items - show all)
- Local search of orthogonal packings using the lower bounds
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- New lower bounds for bin packing problems with conflicts
- Two simple algorithms for bin covering
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- 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 GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- One-dimensional relaxations and LP bounds for orthogonal packing
- 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
- 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 simple randomized algorithm for two-dimensional strip packing
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Recent advances on two-dimensional bin packing problems
- The nesting problem in the leather manufacturing industry
- Data set generation for rectangular placement problems
- An exact method for the 2D guillotine strip packing problem
- Solving a large cutting problem in the glass manufacturing industry
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- An agent-based approach to the two-dimensional guillotine bin packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- The off-line group seat reservation problem
- Reactive GRASP for the strip-packing problem
- Algorithms for nesting with defects
- A branch and bound algorithm for the strip packing problem
- Packing, covering and tiling in two-dimensional spaces
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- A 3-approximation algorithm for two-dimensional bin packing
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- An effective heuristic for the two-dimensional irregular bin packing problem
- A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
- Two-dimensional packing problems: a survey
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- An exact strip packing algorithm based on canonical forms
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- A typology of cutting and packing problems
- Bidimensional packing by bilinear programming
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- Space defragmentation for packing problems
- The three-dimensional knapsack problem with balancing constraints
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Approximation algorithm for the oriented two-dimensional bin packing problem
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Corner occupying theorem for the two-dimensional integral rectangle packing problem
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- Two-dimensional 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
- The two-dimensional bin packing problem with variable bin sizes and costs
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- 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
- Exact solution of the two-dimensional finite bin packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- A variable neighborhood descent approach for the two-dimensional bin packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- A new exact method for the two-dimensional orthogonal packing problem
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- Models and algorithms for three-stage two-dimensional bin packing
- Max-min bin packing algorithm and its application in nano-particles filling
- Packaging optimization using the dynamic vector fields method
- Instance space analysis for 2D bin packing mathematical models
- Design of rectangular packings using decoders of block structure
- Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions
- Exact solution techniques for two-dimensional cutting and packing
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- Two-dimensional packing algorithms for layout of disconnected graphs
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- Simulated annealing for manufacturing systems layout design
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Models for two-dimensional bin packing problems with customer order spread
- The maximum diversity assortment selection problem
- Combinatorial Benders' cuts for the strip packing problem
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- Title not available (Why is no real title available?)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- Algorithms for the two dimensional bin packing problem with partial conflicts
This page was built for publication: Two-Dimensional Finite Bin-Packing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751379)
