An improved typology of cutting and packing problems
From MaRDI portal
Publication:2643945
Recommendations
- A typology of cutting and packing problems
- A survey on the cutting and packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Cutting and packing problems with placement constraints
- Cutting and packing optimization. Problems modeling and solution methods.
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- An introduction to the two‐dimensional rectangular cutting and packing problem
- A Hybrid Optimization Framework for Cutting and Packing Problems
- Exact solution techniques for two-dimensional cutting and packing
- On packing \(T\)-cuts
Cites work
- 3D random stacking of weakly heterogeneous palletization problems
- 4-block heuristic for the rectangle packing problem
- A bottleneck assignment approach to the multiple container loading problem
- A combined cutting-stock and lot-sizing problem
- A comparative evaluation of heuristics for container loading
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- A heuristic for multiple container loading problems
- A hybrid genetic algorithm for the container loading problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A Local Optimization-based Solution to the Rectangle Layout Problem
- A Method for Solving Container Packing for a Single Size of Box
- A method of optimal lattice packing of congruent oriented polygons in the plane
- A Multistage Solution of the Template-Layout Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A New Linear Programming Approach to the Cutting Stock Problem
- A new upper bound for the cylinder packing problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A sequential heuristic procedure for one-dimensional cutting
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A tabu search algorithm for weakly heterogeneous container loading problems
- A typology of cutting and packing problems
- Algorithms for on-line bin-packing problems with cardinality constraints
- Algorithms for the variable sized bin packing problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Allowing for weight considerations in container loading
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- An algorithm for a cutting stock problem on a strip
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- An Algorithm for Two-Dimensional Cutting Problems
- An analytical model for the container loading problem
- An efficient approach for the multi-pallet loading problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An exact algorithm for large multiple knapsack problems
- An exact algorithm for the pallet loading problem
- An exact approach to the strip-packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An LP-based approach to cutting stock problems with multiple objectives
- Annealing, Cylinder Packing By Simulated
- Applied simulated annealing
- Approximate algorithms for constrained circular cutting problems
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Approximation algorithms for extensible bin packing
- Binary knapsack problems with random budgets
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Bounds for Two-Dimensional Cutting
- Compaction and separation algorithms for non-convex polygons and their applications
- Cube packing.
- Cutting optimization with variable-sized stock and inventory status data
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Establishing the optimality of sequencing heuristics for cutting stock problems
- Evaluation of algorithms for one-dimensional cutting
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Exact solution of the two-dimensional finite bin packing problem
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- Guided local search for the three-dimensional bin-packing problem
- Guillotineable bin packing: A genetic approach
- Heuristic algorithms for the three-dimensional bin packing problem
- Heuristics for the container loading problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- scientific article; zbMATH DE number 1640601 (Why is no real title available?)
- scientific article; zbMATH DE number 21364 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- Improved heuristics for sequencing cutting patterns
- Loading Multiple Pallets
- Loading plates with non-identical items
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Models and bounds for two-dimensional level packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- New trends in exact algorithms for the \(0-1\) knapsack problem
- On a pattern sequencing problem to minimize the maximum number of open stacks
- On fuzzy random linear knapsack problems
- On genetic algorithms for the packing of polygons
- On the two-dimensional knapsack problem
- On-line packing with boxes of different sizes
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Packing different-sized circles into a rectangular container
- Recent advances on two-dimensional bin packing problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Solution procedures for cutting lumber into furniture parts
- Solving binary cutting stock problems by column generation and branch- and-bound
- Solving nesting problems with non-convex polygons by constraint logic programming
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- The growth of m-constraint random knapsacks
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- TOPOS -- A new constructive algorithm for nesting problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-dimensional packing problems: a survey
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
Cited in
(only showing first 100 items - show all)- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- An agent-based approach to the two-dimensional guillotine bin packing problem
- The stochastic trim-loss problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A branch and bound algorithm for the strip packing problem
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A recursive algorithm for constrained two-dimensional cutting problems
- The one-dimensional cutting stock problem with due dates
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Strips minimization in two-dimensional cutting stock of circular items
- Packing solar cells on a roof
- Heuristics for container loading of furniture
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Collaborative urban transportation: recent advances in theory and practice
- A local search-based method for sphere packing problems
- Application of optimization for solving a sawing stock problem with a cant sawing pattern
- A memetic algorithm to pack unequal circles into a square
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Solving a large multicontainer loading problem in the car manufacturing industry
- A clique covering MIP model for the irregular strip packing problem
- Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- The skiving stock problem and its relation to hypergraph matchings
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- A customized branch-and-bound approach for irregular shape nesting
- Two-dimensional cutting stock problem with sequence dependent setup times
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
- A MIP-based slicing heuristic for three-dimensional bin packing
- Dealing with nonregular shapes packing
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Product packing and stacking under uncertainty: a robust approach
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- BPPLIB: a library for bin packing and cutting stock problems
- Matheuristics for the irregular bin packing problem with free rotations
- Layout optimisation for an installation port of an offshore wind farm
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- A new load balance methodology for container loading problem in road transportation
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- The load planning problem for double-stack intermodal trains
- Optimal distribution of operating hours over operating rooms using probabilities
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Lower bounds for a bin packing problem with linear usage cost
- Mathematical models and decomposition methods for the multiple knapsack problem
- The min-conflict packing problem
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A global search framework for practical three-dimensional packing with variable carton orientations
- LP bounds in various constraint programming approaches for orthogonal packing
- Efficient algorithms for real-life instances of the variable size bin packing problem
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Exact algorithms for the two-dimensional guillotine knapsack
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- A typology of cutting and packing problems
- A reference length approach for the 3D strip packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- Space defragmentation for packing problems
- A prototype column generation strategy for the multiple container loading problem
- A new dynamic programming procedure for three-staged cutting patterns
- Conservative scales in packing problems
- A variable neighborhood search algorithm for the leather nesting problem
- Solving packing problems by a distributed global optimization algorithm
- Optimized packing multidimensional hyperspheres: a unified approach
- Two-dimensional knapsack-block packing problem
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Optimal clustering of a pair of irregular objects
- The pallet loading problem: three-dimensional bin packing with practical constraints
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Adaptive large neighborhood search for solving the circle bin packing problem
- Models and algorithms for optimising two-dimensional LEGO constructions
- The forgotten sons: warehousing systems for brick-and-mortar retail chains
- Exact solution techniques for two-dimensional cutting and packing
- Queue-constrained packing: a vehicle ferry case study
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- The maximum diversity assortment selection problem
- The integrated lot sizing and cutting stock problem in an automotive spring factory
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
This page was built for publication: An improved typology of cutting and packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643945)
