Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

DOI10.1057/JORS.1992.101zbMATH Open0757.90055OpenAlexW2085774108MaRDI QIDQ4018161FDOQ4018161

Authors: Paul E. Sweeney, Elizabeth Ridenour Paternoster 

Publication date: 16 January 1993

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1992.101

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.

zbMATH Keywords

heuristicpackingbibliographycuttingcutting stocktrim loss

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Cited In (80)

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

Uses Software

• Microlay

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)