Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
From MaRDI portal
Publication:4018161
Recommendations
- An improved typology of cutting and packing problems
- A typology of cutting and packing problems
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- A survey on the cutting and packing problems
- Cutting and packing optimization. Problems modeling and solution methods.
Cited in
(84)- Translational packing of arbitrary polytopes
- 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
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- A sequential heuristic procedure for one-dimensional cutting
- Compaction and separation algorithms for non-convex polygons and their applications
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Packing problems
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- A recursive exact algorithm for weighted two-dimensional cutting
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Computing closely matching upper and lower bounds on textile nesting problems
- 4-block heuristic for the rectangle packing problem
- A search strategy for the one-size assortment problem
- Procedures for solving a 1-dimensional cutting problem
- Optimization of roll cutting in clothing industry
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- The cutting stock problem in a hardboard industry: A case study.
- Exact algorithms for the guillotine strip cutting/packing problem.
- Densest translational lattice packing of non-convex polygons
- Evaluation of algorithms for one-dimensional cutting
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- BPPLIB: a library for bin packing and cutting stock problems
- A hybrid approach for optimization of one-dimensional cutting
- A typology of cutting and packing problems
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- A simulated annealing approach for the circular cutting problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- The nesting problem in the leather manufacturing industry
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Pattern minimisation in cutting stock problems
- Intelligent algorithms for packing and cutting problem
- A survey on the cutting and packing problems
- An exact model for a slitting problem in the steel industry
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
- Mathematical modeling and optimal blank generation in glass manufacturing
- The one-dimensional cutting stock problem with usable leftovers -- a survey
- A note on ``Reducing the number of binary variables in cutting stock problems
- An enumeration scheme to generate constrained exact checkerboard patterns
- Adaptive and restarting techniques-based algorithms for circular packing problems
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- An integrated cutting stock and sequencing problem
- Alternative configurations for cutting machines in a tube cutting mill
- Optimising the cutting of wood fibre plates in the hardboard industry
- Model development and solver demonstrations using randomized test problems
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Preface to the special issue on cutting and packing
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- scientific article; zbMATH DE number 719668 (Why is no real title available?)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- Cutting and packing problems with placement constraints
- Sensitive instances of the cutting stock problem
- Linear models for 1-group two-dimensional guillotine cutting problems
- Tight approximation algorithms for geometric bin packing with skewed items
- An introduction to the two‐dimensional rectangular cutting and packing problem
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority
- Bun splitting: a practical cutting stock problem
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Nested \((2,3)\)-instances of the cutting stock problem
- Column-based strip packing using ordered and compliant containment
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
- Algorithms for the bin packing problem with scenarios
- Tight approximation algorithms for 2D guillotine strip packing
- On guillotine separable packings for the two-dimensional geometric knapsack problem
- A tree search-based heuristic for the three-dimensional single container loading problem
- A parallel branch-and-bound-and-check algorithm for nesting
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- A multi-objective programming approach to 1.5-dimensional assortment problem
- Simplest optimal cutting patterns for equal rectangles
- The constrained compartmentalised knapsack problem
- Cutting and packing optimization. Problems modeling and solution methods.
This page was built for publication: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018161)
