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
- 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?)
- 3D random stacking of weakly heterogeneous palletization problems
- 4-block heuristic for the rectangle packing 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 Multistage Solution of the Template-Layout Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A New Linear Programming Approach to the Cutting Stock 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 method of optimal lattice packing of congruent oriented polygons in the plane
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- 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 Unconstrained Two-Dimensional Guillotine Cutting
- Algorithms for on-line bin-packing problems with cardinality constraints
- Algorithms for the variable sized bin packing problem
- Allowing for weight considerations in container loading
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An LP-based approach to cutting stock problems with multiple objectives
- 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 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
- 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
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Binary knapsack problems with random budgets
- 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)
- 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
- TOPOS -- A new constructive algorithm for nesting problems
- 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
- 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)- Heuristic algorithm for a cutting stock problem in the steel bridge construction
- Packing unequal circles into a strip of minimal length with a jump algorithm
- An efficient method for the three-dimensional container loading problem by forming box sizes
- An analysis of the integrated lot-sizing and cutting-stock problem formulation
- Irregular packing: MILP model based on a polygonal enclosure
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Two-dimensional knapsack-block packing problem
- A global search framework for practical three-dimensional packing with variable carton orientations
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Cutting and packing problems with placement constraints
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- A beam search algorithm for the biobjective container loading problem
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A dynamic adaptive local search algorithm for the circular packing problem
- A heuristic for the three-dimensional strip packing problem
- Computing the asymptotic worst-case of bin packing lower bounds
- Exact solution techniques for two-dimensional cutting and packing
- A variable neighborhood search algorithm for the leather nesting problem
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- A fast heuristic for a three-dimensional non-convex domain loading problem
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- The exact solutions of several types of container loading problems
- Renovation of the cutting stock process
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Nesting and scheduling optimization of additive manufacturing systems: mapping the territory
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Routing problems with loading constraints
- 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
- A survey on the cutting and packing problems
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Conservative scales in packing problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Container loading with multi-drop constraints
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Adaptive beam search lookahead algorithms for the circular packing problem
- A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
- 3D dynamic heterogeneous robotic palletization problem
- A skyline-based heuristic for orthogonal packing rectangles in a circle
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
- Cutting optimization of structural tubes to build agricultural light aircrafts
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- Layout optimisation for an installation port of an offshore wind farm
- Packing cubes into a cube is NP-complete in the strong sense
- Solving packing problems by a distributed global optimization algorithm
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Product packing and stacking under uncertainty: a robust approach
- Strip based compact formulation for two-dimensional guillotine cutting problems
- An investigation into two bin packing problems with ordering and orientation implications
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- 2DPackLib: a two-dimensional cutting and packing library
- Optimising the cutting of wood fibre plates in the hardboard industry
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
- The two-dimensional cutting stock problem within the roller blind production process
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A beam search implementation for the irregular shape packing problem
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Roll cutting in the curtain industry, or: a well-solvable allocation problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Solving the irregular strip packing problem via guided local search for overlap minimization
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
- Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics
- Alternative configurations for cutting machines in a tube cutting mill
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
- A note on the approximability of cutting stock problems
- A linear optimization approach to the combined production planning model
- Modeling soft unloading constraints in the multi-drop container loading problem
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- New lower bounds for bin packing problems with conflicts
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Optimized object packings using quasi-phi-functions
- How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem
- Solving a large multicontainer loading problem in the car manufacturing industry
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- Using a Bin Packing Approach for Stowing Hazardous Containers into Containerships
- Quasi-phi-functions and optimal packing of ellipses
- Optimized packing multidimensional hyperspheres: a unified approach
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- 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
- Collaborative urban transportation: recent advances in theory and practice
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)
